#include <bits/stdc++.h>

using namespace std;

const int MAX_DIGITS = 101;
const int REPEAT = 100;

int T;
int last_digits[REPEAT];

int pow(int p) {
    int n = p % 10 == 0 ? 0 : 1;
    int exp = p % 4 == 0 ? 4 : p;

    p = p % 10;
    for (int i = 0; i < exp; ++i) {
        n = (n * p) % 10;
    }
    return n;
}

void compute_last_digits() {
    for (int i = 1; i < 100; ++i) {
        last_digits[i] = (last_digits[i - 1] + pow(i)) % 10;
    }
}


void solve() {
    char N[MAX_DIGITS];
    int last_two = 0;
    int N_length, last_length;

    scanf("%s", N);
    N_length = strlen(N);
    last_length = min(2, N_length);

    for (int i = last_length; i >= 1; --i) {
        last_two *= 10;
        last_two += N[N_length - i] - '0';
    }
    printf("%d\n", last_digits[last_two % REPEAT]);
}

int main() {
    freopen("cifra.in", "r", stdin);
    freopen("cifra.out", "w", stdout);

    compute_last_digits();

    scanf("%d", &T);
    for (int i = 0; i < T; ++i) {
        solve();
    }
}