// no.52
#include <bits/stdc++.h>

#define MOD 1000000007
#define pe(str) return cout<<(str)<<endl,0
#define px(str) {cout<<(str)<<endl;exit(0);}
#define pr(str) cout<<(str)<<endl
#define prpr(str) cout<<str<<endl
#define db(str) cerr<<"debug:"<<(str)<<endl
#define dbdb(str) cerr<<"debugs:"<<str<<endl
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
#define spr(a) setprecision(a)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef complex<int> point;

template<class InputIterator>
void dump(InputIterator first,InputIterator last,char delim=' '){
	for(InputIterator it=first;it!=last;it++){
		if(it!=first)cout<<delim;
		cout<<*it;
	}
}

ull p(ull x,ull y){
	if(y==0) return 1;
	ull A=p(x,y/2)%MOD;
	// return (y&1?((A*A)%MOD*x)%MOD: (A*A)%MOD);
	return (y&1?((A*A)*x):(A*A));
}

int main(void){
	int n,m;
	int a[10000];
	int b[10000];
	string s;
	int t;
	cin>>t;
	while(t--){
		cin>>s;
		n=0;
		re(i,s.size())a[n++]=s[i]-'0';
		if(n==1){
			cout<<a[0]<<endl;
			continue;
		}
		m=n;
		while(m!=1){
			m=0;
			re(i,n-1) b[m++]=(a[i+1]+a[i])/10+(a[i+1]+a[i])%10;
			copy(b,b+m,a);
			n=m;
		}
		cout<<b[0]<<endl;
	}
	return 0;
}