J. Restore the sequence
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Vanya constructed a sequence fi according to the following rule:

  1. f0 = x, f1 = y;
  2. fi = fi - 1 + fi - 2, i > 1.

Unfortunately, Vanya lost this sequence. However, he memorized one number N, which belongs to this sequence. He also remembers that all elements of the sequence are non-negative integers.

Help Vanya find such x and y, by which he can restore the sequence. Vanya understands that there can be many answers, so he wants the value of x + y to be as small as possible, and in case there are several such pairs, x should be the minimum possible.

Input

The single line contains one integer N — the number that Vanya memorized.

1 ≤ N ≤ 106
Output

In the single line output two integers x and y — the initial parameters of the sequence.

Examples
Input
42
Output
0 2
Input
19
Output
3 2