Fedya and Maths

1000ms

262144K

Description:

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^10⁵). The number doesn't contain any leading zeroes.

Output:

Print the value of the expression without leading zeros.

Sample Input:

Sample Output:

Sample Input:

124356983594583453458888889

Sample Output:

Note:

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

Note to the first sample:

$\text{[math]}$

Informação

Provedor Codeforces

Código CF456B