IccanobiF Sequence
By Alexandre Gadelha, Rede de Ensino Doctum 
Brazil
By Alexandre Gadelha, Rede de Ensino Doctum Brazil
After solving the IccanobiF case1, Fabiano decided to explore the Internet and find whether exists a real IccanobiF Sequence or not.
During the exploration over Internet, he discovered the sequence but it's a little different: the result of each term suffers some kind of "mirror effect" if it has two or more digits. As long as the result would have the digits inverted, this would affect the sequence completed as long as it continues.
Fabiano noticed that IccanobiF Sequence can grow even more than the ordinary Fibonacci Sequence and the number 1 doesn't repeat as expected. As long as this is a complex task for him, he decided to hire you to solve this case! It's up to you!
This is one of End of File (EOF) cases. So many test cases, such wow.
Input will have only one value X (X ∈ ℕ | X ≤ 60) which is the term of IccanobiF Sequence to be search.
For each input, one output with the element of the term X informed of IccanobiF Sequence. After the exhibition of the value, a new line should be printed (as always).
| Input Sample | Output Sample |
|
0 1 2 3 6 7 10 33 40 |
0 1 2 3 13 39 836 265429972 21807674140 |