#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;


ll f(ll n){
    if(n==0) return 2;

    ll res=0;
    for(ll i=max(0LL,n-4);i<=n;i++){
        ll c=1;
        for(ll j=i+1;j<=n;j++){
            c*=j;
            c%=10;
        }
        res+=c;
        res%=10;
    }

    return res;
}


int main(){
    int T;
    cin>>T;
    for(int t=0;t<T;t++){
        ll N;
        cin>>N;

        cout<<f(N)<<endl;
    }

}