Problem Statement:
Yes, the Fibonacci sequence again and again, we all know the Fibonacci sequence, each term of it is the sum of the two previous terms. In this problem we don't care about the actual values of the Fibonacci sequence, we need to know just the last digit, too simple.

F (0) = 0;
F (1) = 1;
F (n) = F (n-1) + F (n-2);

Input Format:
The input consist of multiple lines (<100,000), each has one integer n: 0 <= n <= 100000.

Output Format:
For each line of the input, output the last digit of the term F (n).

Sample Input:
5 13 70007

Sample Output:
5 3 3

Added by: feras_kassar
Added at: 2014-03-14 19:00:00 UTC
Time Limit: 5 seconds
Partial score: No
Source:Damascus University Second Training Contest 2014