//#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <set>
#include <algorithm>
#include <bitset>
#include <time.h>
#include <tuple>
#include <fstream>
#include <iomanip>
#include <utility>

#pragma warning "da 100% din tine. :)"
#define nl '\n'
#define sp ' '
#define pb(x) push_back(x)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define SIZE 3000
#define NR 105
#define N 11
#define INF 10000
#define ll long long
#define ull unsigned ll

using namespace std;
ifstream cin("miting.in");
ofstream cout("miting.out");

template<class v, class type>
void print(v Vector, type nr) {
    for_each(all(Vector), [](type x) {
        cout << x;
    });
}

double logXBaseY(ll X, ll Y) {
    return log2(X) / log2(Y);
}

long long exp_log(long long x, long long n) {
    long long int r = 1;
    while (n) {
        if (n & 1)
            r = (1LL * r * x);
        x = (1LL * x * x);
        n /= 2;
    }
    return r;
}

void nimic() {
    return;
}

int n;
ull imu[11], pu[11];

int main() {
    ios_base::sync_with_stdio(false);
//    freopen("caps.in", "r", stdin);
//    freopen("caps.out", "w", stdout);
    clock_t tStart = clock();
    string k;
    int q;
    cin >> q;
    ull sum = 0;
    int mul20 = 0;
    int sumim = 0;
    for (ull i = 0; i <= 10; ++i) {
        if (i != 0)
            sum = exp_log((ll) i % 10, (ll) i);
        imu[i] = sum % 10;
        if (i != 0)
            sum = exp_log((ll) i % 10, (ll) i + 10);
        pu[i] = sum % 10;
        mul20 += pu[i] + imu[i];
        mul20 %= 10;
        sumim += pu[i];
        sumim %= 10;
    }
    while (q--) {
        cin >> k;
        ull len = k.length();
        if (len < 2) {
            int res = 0;
            for (int i = 0; i <= k[len - 1] - '0'; ++i)
                res += imu[i];
            cout << res % 10 << nl;
            continue;
        }
        int rest = (k[len - 2] - '0') & 1;
        int zeci = (k[len - 2] - '0') >> 1;
        int rez = zeci * mul20 + sumim * rest;
        if (rest) {
            for (int i = 0; i <= k[len - 1] - '0'; ++i)
                rez += pu[i];
        } else
            for (int i = 0; i <= k[len - 1] - '0'; ++i)
                rez += imu[i];
//        cout << rest << ' ' << zeci << ' ' << k << nl;
        cout << rez % 10 << nl;

    }
//        printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}