#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;

long long int powermod(long long int a,long long int b,long long int c)
{
    long long int ans = 1;
    a = a%c;
    while (b > 0)
    {
        if (b% 2 ==1)
            ans = ans * a %c;
        b = b/2;
        a = a* a %c;
    }
    return ans;
}

int main()
{
    int t;
    long long int n;
    cin >> t;
    while (t--)
    {
        cin >> n;
        cout <<powermod(n,n,10) << endl;
    }
    return 0;
}

版权声明：本文为博主原创文章，未经博主允许不得转载。