//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include<regex>
#include <unordered_map>  

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x*x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1)
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  FOR(i,0,n)


//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007;//10^9+7
const LL INF2 = (LL)100000000000000000;//10^18

int tbadd[10][10];


void maketb() {
	for (int i = 0; i < 10; i++) {
		for (int j = 0; j < 10; j++) {
			int buf = i + j;
			buf = buf / 10 + buf % 10;

			tbadd[i][j] = buf;
		}
	}
}

int chartoint(char c) {
	return (int)(c - '0');
}

int main() {

	maketb();
	
	int t; cin >> t;

	for (int i = 0; i < t; i++) {
		int nums[4] = { 0 };

		string s; cin >> s;

		for (int j =0; j<s.size(); j++) {
			nums[s.size() - j - 1] = chartoint(s[s.size() - j - 1]);
		}

		for (int j = s.size()-1; j >=0; j--) {
			for (int k = 0; k < j; k++) {
				nums[k] = tbadd[nums[k]][nums[k+1]];
			}
		}

		cout << nums[0] << endl;
	}
	return 0;
}