#include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <sstream>
#include <numeric>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <cassert>
#include <ctime>
#include <cstdlib>
// #include <classic_algorithms>
// #include <creativity>
using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPV(i, a, b) for (int i = (a); i <= (b); ++i)
#define REPIT(it, v) for(it = v.begin(); it != v.end(); ++it)
#define REPD(i, n) for (int i = (n) - 1; i >= 0; --i)
#define REPVD(i, b, a) for (int i = (b); i >= (a); --i)

#define SZ(a) ((int)a.size())
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define MP make_pair
#define X first
#define Y second

#define CLR(t) memset((t), 0, sizeof(t))
#define CPY(dest, source) memcpy((dest), (source), sizeof(source))
#define MSET(t, v) memset((t), v, sizeof(t))

typedef long long LL; 
typedef vector<int> VI; 
typedef istringstream ISS;
typedef vector<string> VS;
typedef pair<int, int> PII;
template<class T> ostream& operator<<(ostream& os, const vector<T>& a) { int i = 0, n = a.size(); for(;i<n;++i) os<<a[i]<<','; os<<endl; return os; }

int main()
{
       freopen("cifra.in", "rt", stdin);
       freopen("cifra.out", "wt", stdout);

	   int tests;
	   scanf("%d", &tests);

	   while (tests--) {
		   char str[128];
		   scanf("%s", str);
		   int S = strlen(str), T = 0;

		   int d2 = 0;
		   REP(i, S-1) {
			   T = T * 10 + str[i] - '0';
			   d2 = T/2;
			   T &= 1; 
		   }

		   int d1 = (d2 + T) % 10;

		   int res = 0;
		   REPD(c, 10) {
			   if (c + '0' == str[S-1]) {
				   if (T) d2 = (d2 + 1) % 10;
				   else d1 = (d1 + 1) % 10;
			   }

			   int p[5] = {1};
			   REPV(i, 1, 4) p[i & 3] = (p[i-1] * c) % 10;
			   res = (res + d1 * p[c & 3] + d2 * p[(c+2) & 3]) % 10;
		   }

		   printf("%d\n", res);
	   }

       return 0;
}