Fedya studies in a gymnasium. Fedya's maths hometask is to calculate the following expression:
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).
The single line contains a single integer n (0 ≤ n ≤ 10105). The number doesn't contain any leading zeroes.
Print the value of the expression without leading zeros.
4
4
124356983594583453458888889
0
Operation x mod y means taking remainder after division x by y.
Note to the first sample:
#include <cstdio> #include <cstring> using namespace std; char str[100000+10];//注意拿数组进行储存 int main() { scanf("%s",str); int len = strlen(str); int sum = (str[len-2]-'0')*10+str[len-1]-'0'; if(sum%4==0)puts("4");//做题前先打表 else puts("0"); return 0; }