Vasya and Fibonacci#5710
Eighth-grader Vasya enjoys experimenting with Fibonacci numbers. Currently, he is interested in the following question: how can one quickly find the sum of the last two digits of the -th Fibonacci number? If there are not enough digits, Vasya simply adds leading zeros to make up two digits.
Recall that Fibonacci numbers are defined by the following recurrence relations:
Each line of the input contains a single integer (0 \leq k \leq 9223372036854775807).
For each input line, output a single integer on a separate line — the sum of the last two digits of the -th Fibonacci number.
Example 1