#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<math.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<numeric>

using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;

//const ll mod = 1000000007;
const ll mod = 998244353;
const ld pi = 3.14159265358979;

vector<int> ans;

int calc(int x){
  int sum = 0;
  while(x > 0){
    sum += x % 10;
    x /= 10;
  }
  return sum;
}

int solver(){
  string s;
  cin >> s;
  while(s.size() > 1){
    string t;
    for(int i = 0; i < s.size() - 1; i++){
      int now = int(s[i] - '0') + int(s[i + 1] - '0');
      if(now < 10){
        t += to_string(now);
      }else{
        t += to_string(calc(now));
      }
    }
    s = t;
  }
  return int(s[0] - '0');
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  //cout << fixed << setprecision(15);
  int t;
  cin >> t;
  for(int i = 0; i < t; i++){
    ans.push_back(solver());
  }
  for(int i = 0; i < t; i++){
    cout << ans[i] << '\n';
  }
  return 0;
}