Codeforces 456B Fedya and Maths

题目链接：http://codeforces.com/problemset/problem/456/B

B. Fedya and Maths

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Fedya studies in a gymnasium. Fedya's maths hometask is to calculate the following expression:

(1ⁿ + 2ⁿ + 3ⁿ + 4ⁿ) mod 5

for given value of n. Fedya managed to complete the task. Can you? Note that given numbern can be extremely large (e.g. it can exceed any integer type of your programming language).

Input

The single line contains a single integer n (0 ≤ n ≤ 10¹⁰⁵). The number doesn't contain any leading zeroes.

Output

Print the value of the expression without leading zeros.

Sample test(s)

Input

4

Output

4

Input

124356983594583453458888889

Output

0

Note

Operation x mod y means taking remainder after divisionx by y.

Note to the first sample:

循环节为4，所以只要判断n是否能整除4.又有一个数能被4整除当且仅当后两位能被4整除。所以直接取后两位进行判断即可。

代码：

#include<stdio.h>#include<string.h>const int maxn=100005;char s[maxn];int main(){    while(scanf("%s",s)!=EOF)    {        int len=strlen(s);        int a=s[len-1]-'0';        int b=s[len-2]-'0';        int c=a+b*10;        if(c%4==0)            printf("4\n");        else            printf("0\n");    }    return 0;}