#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
using namespace std;
#define lint long long int
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
*/

int main() {
	int T;
	cin >> T;
	vector<string>veca(T);
	for (int ia = 0; ia < T; ia++) {
		cin >> veca.at(ia);
	}
	vector<vector<int>>vecb(T, vector<int>(1000));
	for (int ib = 0; ib < T; ib++) {
		for (int ic = 0; ic < veca.at(ib).size(); ic++) {
			vecb.at(ib).at(ic) = veca.at(ib).at(ic) - '0';
		}
	}
	for (int id = 0; id < T; id++) {
		for (int ie = 0; ie < veca.at(id).size()-1;ie++) {
			for (int ig = 0; ig < veca.at(id).size() - ie - 1; ig++) {
				vecb.at(id).at(ig) = (vecb.at(id).at(ig) + vecb.at(id).at(ig + 1))/10+ (vecb.at(id).at(ig) + vecb.at(id).at(ig + 1))%10;
			}
		}
	}
	for (int ih = 0; ih < T; ih++) {
		cout << vecb.at(ih).at(0) << endl;
	}
}