#include <bits/stdc++.h>

#pragma GCC optimize ("O3")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")

using namespace std;
#define int long long
#define ll long long
#define all (x) begin(x), end (x)
#define xx first
#define yy second


#define cin fin
#define cout fout

ifstream cin ("cifra.in");
ofstream cout ("cifra.out");


using pii = pair <int, int>;
using tii = tuple <int, int, int>;

int query;
constexpr int NMAX = (int) 1e2;

int v[NMAX + 1];
char c[NMAX + 1];

int cif (int n){
    int u = n % 10;
    int ans1 = n % 4;
    int p = 1;
    if (ans1 == 0)
        ans1 = 4;
    while (ans1 --)
        p *= u;
    return p % 10;


}
signed main(void)
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    for (int i = 1; i < NMAX; ++ i)
    {
        v[i] = (v[i - 1] + cif (i)) % 10;
    }
     cin >> query;
     cin.get();
     while (query)
     {
         cin.getline (c, sizeof(c));
         int n = strlen(c);
         int val = c[n - 1] - '0';
         if (n >= 2)
         {
             val += (c[n-2] - '0') * 10;
         }
         cout << v[val] << '\n';
         query --;
     }
    return 0 ^ 0;
}