#include "bits/stdc++.h"
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long mod = 1e9 + 7;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

ll powMod(ll n, ll k, ll m) {
	if (k == 0) {
		return 1;
	} else if (k % 2 == 1) {
		return powMod(n, k - 1, m) * n % m;
	} else {
		ll t = powMod(n, k / 2, m);
		return t * t % m;
	}
}

int main() {
	ll t;
	cin >> t;
	
	vector<string> v;

	rep(i, t) {
		string s;
		cin >> s;
		while (s.size() != 1) {
			string t;
			rep(j, s.size()-1) {
				ll n = s[j]-'0'+s[j+1]-'0';
				if (n > 9) {
					n = n/10+n%10;
				}
				t += to_string(n);
			}
			s=t;
		}
		v.push_back(s);
	}

	for (string s : v) {
		cout << s << endl;
	}
}