P8241 [COCI 2013/2014 #3] RIJEČI

One day, Mirko found a very large screen. At the beginning, there was only one letter $\texttt{A}$ on the screen. Mirko found a button next to the screen. When he pressed it once, the letter on the screen became $\texttt B$. Then he pressed it several more times, and the screen showed $\texttt{BA}$, $\texttt{BAB}$, $\texttt{BABBA}$, $\ldots$ in order. Only then did he realize that every time he pressed the button, each letter $\texttt B$ on the screen changed into $\texttt{BA}$, and each letter $\texttt A$ changed into $\texttt{B}$. Now, Mirko has pressed the button $k$ times, and he wants to know how many letters $\texttt A$ and how many letters $\texttt B$ are on the screen.

Input an integer $k$, representing the number of times Mirko pressed the button.

Output two integers separated by a space, representing the number of letters $\texttt A$ and the number of letters $\texttt B$, respectively.

**Constraints** For $20\%$ of the testdata, it is guaranteed that $k\leqslant 10$. For all testdata, $1\leqslant k\leqslant 45$. **Source** This problem is from **_[COCI 2013-2014](https://hsin.hr/coci/archive/2013_2014/) [CONTEST 3](https://hsin.hr/coci/archive/2013_2014/contest3_tasks.pdf) T1 RIJEČI_**. It uses the original testdata configuration, with a full score of $50$ points. Translated and compiled by [Eason_AC](https://www.luogu.com.cn/user/112917). Translated by ChatGPT 5