#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define MOD 1000000007
#define int long long
using ll = long long;
using namespace std;
const int INF = 1LL << 50;
using P       = pair<int, int>;

template <class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    } else {
        return false;
    }
}
template <class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    } else {
        return false;
    }
}

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
    }
} SETUP;

void solve() {
    string s;
    cin >> s;
    while (s.size() > 1) {
        string t;
        rep(i, 0, (int)s.size() - 1) {
            int left = s[i] - '0', right = s[i + 1] - '0';
            int a = (left + right) / 10 + (left + right) % 10;
            t += a + '0';
        }
        s = t;
    }
    cout << s << endl;
}

signed main() {
    int n;
    cin >> n;
    rep(i, 0, n) {
        solve();
    }
}