#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

ll count(ll n, ll r){
    ll x = r;
    ll ans = 0;
    while(true){
        ans += n/x;
        if(x > n/r) break;
        x *= r;
    }
    return ans;
}

void solve(){
    ll n; cin >> n;
    ll ans = 0;
    for(ll x = n; x >= 0; x--){
        if(x%10 == 0) break;
        // if(count(n, 5) > count(x, 5) && count(n, 2) > count(x, 2)) break;
        ll r = 1;
        for(ll i = n; i > x; i--) r = (r*i)%10;
        ans += r;
        ans %= 10;
    }
    cout << ans << endl;
}

void test(){
    double a = exp(1);
    ll p = 1;
    for(int x = 1; x <= 15; x++){
        a *= x;
        p *= x;
        ll b = (ll)a;
        cout << x << ':' << b%10 << endl;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    // test();
    int t; cin >> t;
    while(t--) solve();
}