April Fools Day Contest
A. Mysterious numbers - 1
time limit per test
2 seconds
memory limit per test
256 megabytes
input
stdin
output
stdout
Input

The input contains two integers a1, a2 (0 ≤ ai ≤ 109), separated by a single space.

Output

Output a single integer.

Examples
Input
3 14
Output
44
Input
27 12
Output
48
Input
100 200
Output
102
B. Star
time limit per test
2 seconds
memory limit per test
256 megabytes
input
stdin
output
stdout
Input

The input contains a single integer a (1 ≤ a ≤ 18257).

Output

Print a single integer output (1 ≤ output ≤ 2·109).

Examples
Input
2
Output
13
C. A Piece of Cake
time limit per test
2 seconds
memory limit per test
256 megabytes
input
stdin
output
stdout

How to make a cake you'll never eat.

Ingredients.

  • 2 carrots
  • 0 calories
  • 100 g chocolate spread
  • 1 pack of flour
  • 1 egg

Method.

  1. Put calories into the mixing bowl.
  2. Take carrots from refrigerator.
  3. Chop carrots.
  4. Take chocolate spread from refrigerator.
  5. Put chocolate spread into the mixing bowl.
  6. Combine pack of flour into the mixing bowl.
  7. Fold chocolate spread into the mixing bowl.
  8. Add chocolate spread into the mixing bowl.
  9. Put pack of flour into the mixing bowl.
  10. Add egg into the mixing bowl.
  11. Fold pack of flour into the mixing bowl.
  12. Chop carrots until choped.
  13. Pour contents of the mixing bowl into the baking dish.

Serves 1.

Input

The only line of input contains a sequence of integers a0, a1, ... (1 ≤ a0 ≤ 100, 0 ≤ ai ≤ 1000 for i ≥ 1).

Output

Output a single integer.

Examples
Input
4 1 2 3 4
Output
30
D. Broken checker
time limit per test
2 seconds
memory limit per test
256 megabytes
input
stdin
output
stdout

"This problem is rubbish! There is not statement, and there are only 5 test cases. The problemsetter took liberties with this problem!" — people complained in the comments to one round on Codeforces. And even more... No, wait, the checker for the problem was alright, that's a mercy.

Input

The only line of the input contains an integer between 1 and 5, inclusive. All tests for this problem are different. The contents of the test case doesn't need to be equal to its index.

Output

The only line of the output contains an integer between 1 and 3, inclusive.

Examples
Note

This problem has no samples, since there so few test cases.

E. MYSTERIOUS LANGUAGE
time limit per test
2 seconds
memory limit per test
256 megabytes
input
stdin
output
stdout

You are given a mysterious language (codenamed "Secret") available in "Custom Test" tab. Find out what this language is and write a program which outputs its name. Note that the program must be written in this language.

Input

This program has only one test, and it's empty (it doesn't give your program anything to read).

Output

Output the name of the mysterious language.

Examples
F. ucyhf
time limit per test
2 seconds
memory limit per test
64 megabytes
input
stdin
output
stdout

qd ucyhf yi q fhycu dkcruh mxeiu huluhiu yi q tyvvuhudj fhycu dkcruh. oekh jqia yi je vydt jxu djx ucyhf.

Input

jxu ydfkj sediyiji ev q iydwbu ydjuwuh d (1 ≤ d ≤ 11184) — jxu edu-rqiut ydtun ev jxu ucyhf je vydt.

Output

ekjfkj q iydwbu dkcruh.

Examples
Input
1
Output
13
G. Mysterious numbers - 2
time limit per test
2 seconds
memory limit per test
256 megabytes
input
stdin
output
stdout
Input

The only line of input contains three integers a1, a2, a3 (1 ≤ a1, a2, a3 ≤ 20), separated by spaces.

Output

Output a single integer.

Examples
Input
2 3 2
Output
5
Input
13 14 1
Output
14
Input
14 5 9
Output
464
Input
17 18 3
Output
53
H. A polyline
time limit per test
2 seconds
memory limit per test
256 megabytes
input
stdin
output
stdout
Input

The input contains two integers a, b (1 ≤ a ≤ 10, 0 ≤ b ≤ 22·a - 1) separated by a single space.

Output

Output two integers separated by a single space.

Examples
Input
1 0
Output
0 0
Input
2 15
Output
3 0
Input
4 160
Output
12 12