跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1944. Fedya and Maths

    ID: 1950 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 2 上传者: 标签>数学数论基础难度共享题库Codeforces英文题面题目来源题面语言

Fedya and Maths

题目描述

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:

(1n+2n+3n+4n)mod5

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≤10105). The number doesn't contain any leading zeroes.

Output

Print the value of the expression without leading zeros.

Examples
Input
4
Output
4
Input
124356983594583453458888889
Output
0
Note

Operation xmody means taking remainder after division x by y.

Note to the first sample:

题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 1524 题。保留原作者与原赛事署名。