#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <random>
#include <iomanip>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)

template<class T>
using vi = vector<T>;

template<class T>
using vii = vector<vi<T>>;

template<class T>
using viii = vector<vii<T>>;

using P = pair<ll, int>;

void chmin(ll & x, ll y) { x = min(x, y); }

double e = exp(1);

void solve() {
	ll n;
	cin >> n;
	
	if (n <= 15) {
		double te = e;
		rep(i, n) te *= i + 1;
		ll num = te;
		num %= 10;
		cout << num << endl;
		return;
	}

	ll res = 1;
	ll temp = 1;
	for (ll i = n; i > 0; i--) {
		temp *= (i % 10);
		res += temp;
		if (temp == 0) break;
	}
	cout << res % 10 << endl;
	return;
}

int main()
{
	int t;
	cin >> t;
	while (t--) solve();
	return 0;
}