Fedya studies in a gymnasium. Fedya's maths hometask is to calculate the following expression: (1 n + 2 n + 3 n + 4 n ) 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).
输入描述:
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.
示例1

输入

4<br />124356983594583453458888889<br />

输出

4<br />0<br />

备注:
Operation x mod y means taking remainder after division x by y.Note to the first sample:
加载中...