#include <cstdio>
#include <algorithm>
#include <time.h>
#include <queue>
#include <cmath>
#include <stack>
#include <fstream>
//#include <iostream>
#include <bitset>

using namespace std;
#define nl '\n'
#define all(v) v.begin(),v.end()
#define eb(x) emplace_back(x)
#define ull unsigned long long
#define N 1002
ifstream cin("cifra.in");
ofstream cout("cifra.out");

template<class a, class type>
void print(a v, type t) {
    for_each(all(v), [](type x) { cout << x << ' '; });
    cout << nl;
}
int s,sum,m,t;
vector<int> lastDigit(100);
string n;
int main() {
    ios_base::sync_with_stdio(false);
    clock_t tStart = clock();
    for(int i=1;i<=100;++i){
        s = 1;
        for(int j=1;j<=i;++j){
            s *= i;
            if(s>9) s %= 10;
        }
        sum += s;
        sum %= 10;
        if(i==100) lastDigit [0] = sum;
        else lastDigit[i] = sum;
    }
    cin >> t;
    while(t--){
        cin >> n;
        if(n.size()<3) m = stoi(n);
        else {
            n.replace(n.begin(),n.end(),n.end()-3,n.end());
            m = stoi(n);
        }
        cout << lastDigit[m%100] << nl;
    }
    printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}