#include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
const int N=4005;
int a[N],b[N],c[N];
void solve() {
    string s;
    cin >> s;
    int n=s.size();
    FOR(i,0,n-1) a[i]=s[n-1-i]-'0';
    FOR(v,1,9) {
        FOR(i,0,n-1) b[i]=v;
        int x=0;
        FOR(i,0,n-1) {
            x+=a[i]-b[i];
            if(x<0) {
                c[i]=x+10;
                x=-1;
            } else {
                c[i]=x;
                x=0;
            }
        }
        if(x<0) continue;
        int p=n;
        while(p && c[p-1]==0) --p;
        if(p) {
            int w=1;
            FOR(i,0,p-2) if(c[i]!=c[p-1]) w=0;
            if(w) {
                FOR(i,0,n-1) cout << b[i];
                cout << ' ';
                FOR(i,0,p-1) cout << c[i];
                cout << '\n';
                return ;
            }
        }
    }
    FOR(v,1,9) {
        FOR(i,0,n-2) b[i]=v;
        b[n-1]=0;
        int x=0;
        FOR(i,0,n-1) {
            x+=a[i]-b[i];
            if(x<0) {
                c[i]=x+10;
                x=-1;
            } else {
                c[i]=x;
                x=0;
            }
        }
        if(x<0) continue;
        int p=n;
        while(p && c[p-1]==0) --p;
        if(p) {
            int w=1;
            FOR(i,0,p-2) if(c[i]!=c[p-1]) w=0;
            if(w) {
                FOR(i,0,n-2) cout << b[i];
                cout << ' ';
                FOR(i,0,p-1) cout << c[i];
                cout << '\n';
                return ;
            }
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while(T--) solve();
    return 0;
}