#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using LL = long long;
using pii = pair<int, int>;
#define sz(x) signed(size(x))

void solve() {
    string s;
    cin >> s;
    int cnt = 0;
    int n = s.size();
    for(int i = 0;i < n;i ++){
        if(s[i] == '-'){
            cnt += 1;
            if(i == 0 || i == n-1){
                cout << "invalid\n";
                return ;
            }
            if(cnt == 3 && i != n-2){
                cout << "invalid\n";
                return;
            }
                
        }
        if(s[i] == 'X' && i != n-1){
            cout << "invalid\n";
            return ;
        }
    }
    if(cnt > 3 || n - cnt != 10){
        cout << "invalid\n";
        return;
    }
    
    cnt = 10;
    int sum = 0;
    for(char c : s){
        if(c != '-'){
            if(c == 'X')
                sum += 10 * cnt;
            else
                sum += (c - '0') * cnt;
            cnt -= 1;
        }
    }
    if(sum % 11){
        cout << "invalid\n";
        return ;
    }
    cnt = 0;
    s = "978-" + s;
    s.pop_back();
    n = s.size();
    sum = 0;
    for(int i = 0;i < n;i ++){
        if(s[i] != '-'){
            sum += (cnt % 2 == 0 ? 1 : 3) * (s[i] - '0');
            cnt += 1;
        }
    }
    cout << s << (10 - sum%10) % 10 << "\n";
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}