#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main(){
  int t;
  cin >> t;
  while(t--){
    string s;
    cin >> s;
    int a[s.length()];
    FOR(i,0,s.length()){
      a[i] = s[i] - '0';
    }
    FOR(i,0,s.length()-1){
      FOR(j,0,s.length()-1-i){
        if(a[j]+a[j+1]<10) {
          a[j] = a[j] + a[j+1];
        } else {
          a[j] = (a[j] + a[j+1]) / 10 + (a[j] + a[j+1]) % 10;
        }
      }
    }
    cout << a[0] << endl;
  }
  return 0;
}