#include <bits/stdc++.h>
#define dbg(x) cerr << #x << ':' << (x) << endl; 
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(),x.end()

int n;
string s;

void solve() {
    deque<int> hy,dig;
    for (int i = 0; i < n; ++i) {
        if (s[i]=='-') {
            hy.push_back(i);
        }
        else {
            dig.push_back((s[i]=='X' ? 10 : s[i] - '0'));
        }
    }
    bool ok = true;
    if (hy.size() > 3) {
        ok = false;
    }
    if (hy.size() >= 1 && hy.front() == 0) {
        ok = false;
    }
    if (hy.size() >= 1 && hy.back() == n-1) {
        ok = false;
    }
    for (int i = 0; i+1 < hy.size(); ++i) if (hy[i]+1 == hy[i+1]) {
        ok = false;
        break;
    }
    if (hy.size() == 3 && hy.back() != n-2) {
        ok = false;
    }
    if (dig.size() != 10) {
        ok = false;
    }
    if (ok) {
        int mod = 11;
        int sum = 0;
        for (int i = 0; i < 9; ++i) {
            sum += (10 - i) * dig[i];
        }
        sum %= mod;
        int cs = (mod - sum) % mod;
        if (dig.back() != cs) {
            ok = false;
        }
    }

    if (ok) {
        string ans = "978-" + s;
        ans.pop_back();
        dig.push_front(8);
        dig.push_front(7);
        dig.push_front(9);
        int mod = 10;
        int sum = 0;
        for (int i = 0; i < 12; ++i) {
            sum += (i % 2 == 0 ? 1 : 3) * dig[i];
        }
        sum %= mod;
        int cs = (mod - sum) % mod;
        ans.push_back(cs + '0');
        cout << ans << '\n';
    }
    else {
        cout << "invalid\n";
    }
}

int main()
{
    int t;
    cin >> t;
    while (t--) {
        cin >> s;
        n = s.size();
        solve();
    }
}