Problem Description

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

 

Sample Output

 #include<bits/stdc++.h>

 using namespace std;

 int mod_exp(int a, int b, int c)        //快速幂取余a^b%c

 {

     int res, t;

     res =  % c;

     t = a % c;

     while (b)

     {

         if (b & )

         {

             res = res * t % c;

         }

         t = t * t % c;

         b >>= ;

     }

     return res;

 }

 int main() {

     int t;

     while(~scanf("%d",&t))

     {

         while(t--)

         {

             int n;

             scanf("%d",&n);

             printf("%d\n",mod_exp(n,n,)%);

         }

     }

     return ;

 }