#include <bits/stdc++.h>
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define rep(i, a, b) for (int i = (a), I = (b); i <= I; ++i)
#define per(i, a, b) for (int i = (a), I = (b); i >= I; --i)
using i64 = long long;
using pii = pair<int, int>;
template<typename T> void up(T &x, T y) { if (x < y) x = y; }
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

void solve() {
    string s;
    cin >> s;
    reverse(s.begin(), s.end());
    int n = s.size();
    rep(i, 0, n - 1) s[i] -= '0';
    s.push_back(0);

    auto check = [&](int x, int a, int y, int b) {
        vector<int> t(n + 1);
        rep(i, 0, a - 1) t[i] += x;
        rep(i, 0, b - 1) t[i] += y;
        rep(i, 0, n - 1) t[i + 1] += t[i] / 10, t[i] %= 10;
        rep(i, 0, n) if (s[i] != t[i]) return false;
        rep(i, 1, a) cout << x;
        cout << " ";
        rep(i, 1, b) cout << y;
        cout << "\n";
        return true;
    };

    rep(x, 1, 9) rep(y, 1, 9) {
        if ((x + y) % 10 != s[0]) continue;
        int pos = 1;
        while (pos < n && s[pos] == s[0] + (x + y >= 10)) ++pos;
        if (check(x, pos, y, n - 1)) return;
        if (check(x, pos, y, n)) return;
        if (check(x, n - 1, y, pos)) return;
        if (check(x, n, y, pos)) return;
    }
    rep(x, 1, 9) rep(y, 1, 9) {
        if ((x + y) % 10 != s[0]) continue;
        int pos = 1;
        while (pos < n - 1 && s[pos] == s[0] + (x + y >= 10)) ++pos;
        if (check(x, pos, y, n - 1)) return;
        if (check(x, pos, y, n)) return;
        if (check(x, n - 1, y, pos)) return;
        if (check(x, n, y, pos)) return;
    }
}   

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    int T; cin >> T;
    while (T--) solve();

    return 0;
}