#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
#define CININIT cin.tie(0),ios::sync_with_stdio(false)
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

constexpr ll mod = 1e9+7;

void solve(){
    string s;cin>>s;
    while(s.size()>1){
        string str;
        for(int i=0;i<s.size()-1;i++){
            int t = s[i]-'0' + s[i+1]-'0';
            if(t>9){
                t = (t/10) + (t%10);
            }
            str.push_back(t+'0');
        }
        s = str;
    }
    cout << s << endl;
}

int main(){
    int T;
    cin>>T;
    rep(i,T){
        solve();
    }
}