Codeforces Round #383 (Div. 2) A

最新推荐文章于 2019-01-08 21:34:15 发布

jasonkwan12

最新推荐文章于 2019-01-08 21:34:15 发布

阅读量211

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/jasonkwan12/article/details/53503007

本文介绍了一种快速计算1378^n的末位数字的方法，帮助Mehrdad通过Arpa设置的考试挑战。使用模幂运算算法，可以在短时间内得到准确答案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A. 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.

$\text{[math]}$

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.

#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
ll mod_pow(ll x,ll n,ll mod)
{
    ll res=1;
    while(n>0)
    {
        if(n&1) res=res*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return res;
}
int main()
{
    ll n,sum;
    while(cin>>n)
    {sum=0;

           sum=mod_pow(1378,n,10);
        cout<<sum<<endl;
    }
}