#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define mod 1000000007;

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

int T;
vector<string> v;

 int main()
 {
	 cin >> T;
	 for (int i = 0; i < T; i++) {
		 string s,num,res="";
		 cin >> s;
		 if (s.size() == 1)v.push_back(s);
		 else {
			 while (res.size() != 1) {
				 res = "";
				 for (int j = 0; j < s.size() - 1; j++) {
					 string str = "";
					 str = to_string(s[j] - '0' + s[j + 1] - '0');
					 if (str.size() > 1) {
						 str = to_string(str[0] - '0' + str[1] - '0');
					 }
					 res += str;
				 }
				 s = res;
			 }
			 v.push_back(res);
		 }
	 }

	 for (int i = 0; i < T; i++) {
		 cout << v[i] << endl;
	 }
	return 0;
 }