#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RFOR(i, a, b) for (int i=a;i>=b;--i)
#define ll long long
#define all(a) a.begin(),a.end()
#define ull unsigned long long
#define pb(x) push_back(x)
#define dbg(x) cout<<#x<<" : "<<(x)<<endl;
using namespace std;
int t;
string s[1000];

void solve(int num) {
  int len = s[num].size();
  if (len == 1) {
    cout << s[num] << endl;
    return;
  }

  rep(i, len-1) {
    rep(j, len-1-i) {
      if ((s[num][j]-'0') + (s[num][j+1]-'0') < 10) {
        s[num][j] = '0'+ ((s[num][j]-'0') + (s[num][j+1]-'0'));
      } else {
        int tmp = (s[num][j]-'0') + (s[num][j+1]-'0');
        s[num][j] = '0' + (1 + (tmp%10));
      }
    }
  }
  cout << s[num][0] << endl;
  return;
}

int main() {
  cin >> t;
  rep(i, t) cin >>s[i];
  rep(i, t) solve(i);

  return 0;
}