#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };

using LL = long long int;
using LD = long double;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

int func(int x, int y) {
	int v = x + y;

	if (10 <= v) {
		v = v / 10 + v % 10;
	}

	return v;
}

int solve(string s) {
	int sz = s.size();
	reverse(ALL(s));

	vi rs(sz);
	for (int i = 0; i < sz; i++) {
		rs[i] = s[i] - '0';
	}
	
	for (int i = sz - 1; i >= 1; i--) {
		vi ts(sz);
		for (int j = sz - 1; j >= 1; j--) {
			ts[j] = func(rs[j], rs[j - 1]);
		}
		ts.erase(ts.begin());
		rs = ts;
		sz--;
	}
	

	return rs[0];
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t;
	cin >> t;

	for (int i = 0; i < t; i++) {
		string s;
		cin >> s;

		cout << solve(s) << endl;
	}
	return 0;
}