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<iostream>

#include<string>

#include<algorithm>

#include<cmath>

using namespace std;

typedef long long ll;

ll power(const ll a,const ll n)

{

    ll sum=1;

    for (int i=1; i<=n; i++)

    {

        sum=sum*a;

    }

    return sum;

}

int main(void)

{

    ll n,t,ans;

    int tt;

    cin>>tt;

    while (tt--)

    {

        cin>>n;

        t=n%10;

        if(t==1||t==5||t==0||t==6)

        {

            cout<<t<<endl;

            continue;

        }

        else

        {

            ans=power(t,n%4+4)%10;

            cout<<ans<<endl;

            continue;

        }

    }

    return 0;

}