/* -*- coding: utf-8 -*-
 *
 * 432.cc: No.432 占い(Easy) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 1000;

/* typedef */

/* global variables */

/* subroutines */

int as[2][MAX_N];

/* main */

int main() {
  int tn;
  cin >> tn;
  while (tn--) {
    string s;
    cin >> s;

    int n = s.size();
    int cur = 0, nxt = 1;
    for (int i = 0; i < n; i++) as[0][i] = s[i] - '0';

    while (n > 1) {
      n--;
      for (int i = 0; i < n; i++) {
	int d = as[cur][i] + as[cur][i + 1];
	as[nxt][i] = d % 10 + d / 10;
      }
      cur ^= 1, nxt ^= 1;
    }

    printf("%d\n", as[cur][0]);
  }
  return 0;
}