TheForces Round #29 (Clown-Forces)
A. Is It Rated??
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Input

The only line contains two integers, $$$m$$$ and $$$d$$$ ($$$1 \leq m \leq 12$$$, $$$1 \leq d \leq 31$$$).

Output

Output "YES" or "NO" (without quotes) for each test case.

You can print each letter in any case. For example, yes, Yes, YeS will all be recognized as a positive answer.

Examples
Input
1 1
Output
NO
Input
2 31
Output
NO

B. TheForces ORZ
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

ZRO all strong guys in TheForces ORZ

Input

The only line contains a single integer $$$n$$$ ($$$1 \leq n \leq 8$$$).

Output

Output the answer.

Examples
Input
2
Output
2122
Input
7
Output
1851

C. The Other Half
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given Input and Output you task is to know the logic behind the output.

Input

The first line contains a single integer $$$T$$$ ($$$1 \leq T \leq 2 ⋅ 10^{4}$$$) — the number of test cases.

Each test case consists of two integers, $$$A$$$ and $$$B$$$ ($$$0 \leq A \leq 10^{18}$$$, $$$0 \leq B \leq 10^{18}$$$)

Output

Output "YES" or "NO" (without quotes) for each test case.

You can print each letter in any case. For example, yes, Yes, YeS will all be recognized as a positive answer.

Example
Input
6
18 13
110 17
0 0
12 43
220 35
1 2
Output
YES
YES
NO
NO
YES
YES

D. Important Memories
time limit per test
1 second
memory limit per test
255 megabytes
input
standard input
output
standard output

Let's think back about some important memories where us, competitive programmers, have to go through. For example, all our ACs.

Input

The only line contains a single integer $$$n$$$ ($$$1 \leq n \leq 6$$$).

Output

Output the answer.

Examples
Input
1
Output
256
Input
2
Output
256
Input
3
Output
256

E. Fixing Chaos
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

It's $$$\texttt{Apr 1, 2024}$$$. In this alternate universe, CodeForces is in chaos. Mass bots swarm. Downvote bombs happening everywhere. Every blog posted having at least $$$10^3$$$ downvotes. You need to go back to see what went wrong.

Anyways, in the real universe, it turns out that a user named Xellos has the most number of comments posted in CodeForces prior to $$$\texttt{Apr 1, 2024}$$$.

Input

The only line contains a single integer $$$n$$$ ($$$1 \leq n \leq 8$$$) — the position of a chaos point.

Output

Output a single integer, representing the number of $$$n^{th}$$$ chaos point.

Examples
Input
1
Output
65664
Input
8
Output
124060
Input
3
Output
105129
Note

For the first test case, the first chaos point has the number $$$65664$$$.

F. Apple
time limit per test
4 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output
Example
Input
2
5
1 2
3 4
5 3
3 2
4
3 4
5 1
4 4
1 3
3
1 2
1 3
3
1 1
2 3
3 1
Output
2
2
1
4
4
1
2