Codeforces 742A-Arpa’s hard exam and Mehrdad’s naive cheat（快速幂）

Arpa’s hard exam and Mehrdad’s naive cheat

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There exists an island called Arpa’s land, some beautiful girls live there, as ugly ones do.

Mehrdad wants to become minister of Arpa’s land. Arpa has prepared an exam. Exam has only one question, given n, print the last digit of 1378n.

Mehrdad has become quite confused and wants you to help him. Please help, although it's a naive cheat.

Input

The single line of input contains one integer n (0  ≤  n  ≤  109).

Output

Print single integer — the last digit of 1378n.

Examples

input

1

output

8

input

2

output

4

Note

In the first example, last digit of 13781 = 1378 is 8.

In the second example, last digit of 13782 = 1378·1378 = 1898884 is 4.

题意：1378的n次方的末尾数

#include <iostream>
#include <cstdio>
#include <cmath>
#include <queue>
#include <algorithm>
#include <cstring>
#include <stack>

using namespace std;

int f(int x)
{
    int sum=1,s=8;
    while(x)
    {
        if(x&1)
        {
            sum*=s;
            sum%=10;
        }
        s*=s;
        s%=10;
        x/=2;
    }
    return sum;
}

int main()
{
    int n;
    while(~scanf("%d",&n))
        printf("%d\n",f(n));
    return 0;
}