#描述#
A Fibonacci sequence is calculated by adding the previous two members in the sequence,with the first two members being both 1.Namely,f(1)=1,f(2)=1,f(n>3)=f(n-1)+f(n-2).<br>
Your task is to take a number n as input,and print the result of that Fibonacci mod five.

#格式#
##输入格式##
Each line will contain an integer n(n&lt=10^9).Process to end of file.

##输出格式##
For each case,output the result in a line.

#样例1#
##样例输入1##

1
5

##样例输出1##

1
0

#限制#
1000ms
32768KB

#提示#

#来源#