#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    char a[10][10];
    rep(i,10){
        rep(j,10){
            a[i][j] = (i + j) / 10 + (i + j) % 10 + 48;
        }
    }

    int q;
    cin >> q;
    rep(loop, q){
        string s;
        cin >> s;
        while(s.size() > 1){
            int n = s.size();
            string t;
            rep(i,n-1){
                t += a[s[i]-48][s[i+1]-48];
            }
            s = t;
        }
        cout << s << endl;
    }
    return 0;
}