#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

ll d[10000];

int main() {
	rep(i, 0, 10) {
		rep(j, 0, 10) {
			rep(k, 0, 10) {
				rep(l, 0, 10) {
					ll a = i * 1000 + j * 100 + k * 10 + l;
					vector<ll> v;
					v.pb(i);
					v.pb(j);
					v.pb(k);
					v.pb(l);
					while (1) {
						if (v.sz == 1)break;
						vector<ll> v1;
						rep(j, 0, v.sz - 1) {
							ll a = v[j] + v[j + 1];
							v1.pb(a % 10 + a / 10);
						}
						v = v1;
					}
					d[a] = v[0];
				}
			}
		}
	}
	ll T;
	cin >> T;
	rep(t, 0, T) {
		string s;
		cin >> s;
		vector<ll> v;
		rep(i, 0, s.sz) {
			v.pb(s[i] - '0');
		}
		while (1) {
			if (v.sz < 4)break;
			vector<ll> v1;
			ll a = v[0] * 1000 + v[1] * 100 + v[2] * 10 + v[3];
			v1.pb(d[a]);
			rep(i, 4, v.sz) {
				a = (a % 1000) * 10 + v[i];
				v1.pb(d[a]);
			}
			v = v1;
		}
		while (1) {
			if (v.sz == 1)break;
			vector<ll> v1;
			rep(j, 0, v.sz - 1) {
				ll a = v[j] + v[j + 1];
				v1.pb(a % 10 + a / 10);
			}
			v = v1;
		}
		cout << v[0] << endl;
	}
	return 0;
}