Problem Description

One day, Mirko found a large screen that initially displayed only the letter $\texttt{A}$. Next to the screen, he discovered a button. Each time he pressed the button, the letter on the screen changed. After the first press, the screen displayed $\texttt{B}$, then $\texttt{BA}$, $\texttt{BAB}$, $\texttt{BABBA}$, and so on. Mirko noticed that each press of the button transformed the letter $\texttt{B}$ into $\texttt{BA}$ and the letter $\texttt{A}$ into $\texttt{B}$.

Now, after pressing the button $k$ times, Mirko wants to know how many letters $\texttt{A}$ and $\texttt{B}$ are displayed on the screen.

Input Format

A single integer $k$, representing the number of times Mirko pressed the button.

Output Format

Two integers separated by a space, representing the number of letters $\texttt{A}$ and the number of letters $\texttt{B}$, respectively.

Sample Input and Output

Sample Input #1

1

Sample Output #1

0 1

Sample Input #2

4

Sample Output #2

2 3

Sample Input #3

10

Sample Output #3

34 55

Notes

[Data Range and Constraints]

For $20\%$ of the test cases, $k \leq 10$.
For all test cases, $1 \leq k \leq 45$.

[Problem Source]

This problem is from COCI 2013-2014 CONTEST 3 T1 RIJEČI, configured with the original data. The full score is $50$ points.

Provided by Eason_AC for translation and arrangement.

见题面 Input 部分

见题面 Output 部分