Codeforces Round #260 (Div. 2)456B - Fedya and Maths （找循环节，大数取模）那些用int的人运气真好，竟然没人去Hack

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 number n 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 division x by y.

Note to the first sample:

简单计算可得循环节为4

AC代码：

#include <stdio.h>
#include <string.h>
char a[100005];

int ff(){
    int len,i,ans;
    len=strlen(a);
    ans=0;
    for(i=0;i<len;i++){
        ans=ans*10+a[i]-48;
        if(ans>=4)
            ans%=4;
    }
    return ans;
}

int main(){
    while(~scanf("%s",a)){
        int w;
        w=ff();
        if(!w)
            printf("4\n");
        else
            printf("0\n");
    }
    return 0;
}