#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int T; cin >> T;
    while (T--) {
        string s; cin >> s;
        int n = s.size();
        vector<vector<int>> dp(n, vector<int>(n));
        for (int i = 0; i < n; i++) dp[0][i] = s[i] - '0';
        for (int i = 1; i < n; i++) for (int j = 0; j < n - i; j++) {
            int t = dp[i - 1][j] + dp[i - 1][j + 1];
            dp[i][j] = t / 10 + t % 10;
        }
        cout << dp[n - 1][0] << endl;
    }
    return 0;
}