Description

Please compute the $n$-th Fibonacci number, take it $\bmod\,2^{31}$, and factor the result into prime factors.

Input Format

Input a positive integer $n$.

Output Format

Output the prime factorization of the $n$-th Fibonacci number after applying $\bmod\,2^{31}$.

5

5=5

6

8=2*2*2

Hint

$n \le 48$.

Translated by ChatGPT 5