Given a positive integer N, you should output the most right digit of N^N.
Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single positive integer N(1<=N<=1,000,000,000).
Output For each test case, you should output the rightmost digit of N^N.
Sample Input
2 3 4Sample Output
7
6
Hint
In the first case, 3 * 3 * 3 = 27, so the rightmost digit is 7. In the second case, 4 * 4 * 4 * 4 = 256, so the rightmost digit is 6.
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<math.h>
using namespace std;
const long long mod=1000000000;
long long kuaisu(long long a,long long mod)
{
long long res=1,b=a;
while(b>0)
{
if(b&1)
res=res*a%mod;
b=b>>1;
a=a*a%mod;
}
return res;
}
int main()
{
int T;
long long N;
scanf("%d",&T);
while(T--)
{
scanf("%lld",&N);
int i;
long long c=kuaisu(N,mod);
printf("%d\n",c%10);
}
}