#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

int main() {
    vector<vector<ll>> comb(10, vector<ll>(10, 0));
    for (ll i = 0; i < 10; i++){
        comb[i][0] = 1;
        comb[i][i] = 1;
    }
    for (ll i = 2; i < 10; i++){
        for (ll j = 1; j < i; j++){
            comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % 9;
        }
    }
    ll T;
    cin >> T;   
    while (T--){
        string S;
        cin >> S;
        ll N = S.size();

        ll ans = 0;

        vector<ll> primes(10, 0);
        for (ll i = 0; i < N; i++){
            if (i > 0){
                ll bunshi = N - i;
                ll bunbo = i;

                for (ll j = 2; j * j <= bunshi; j++){
                    while (bunshi % j == 0){
                        bunshi /= j;
                        primes[j % 9]++;
                    }
                }
                if (bunshi != 1){
                    primes[bunshi % 9]++;
                }

                for (ll j = 2; j * j <= bunbo; j++){
                    while (bunbo % j == 0){
                        bunbo /= j;
                        primes[j % 9]--;
                    }
                }
                if (bunbo != 1){
                    primes[bunbo % 9]--;
                }
            }
            ll rem = 1;
            for (ll j = 1; j < 9; j++){
                rem *= my_pow(j, primes[j], 9);
                rem %= 9;
            }
            ans += rem * (ll)(S[i] - '0');
            ans %= 9;
            // debug(primes);
        }
        if (S == "0"){
            cout << 0 << endl;
        }
        else{
            cout << (ans == 0 ? 9 : ans) << endl;
        }
    }
}