#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

string sub(const string& s, const string& t) {
    int n = s.size(), m = t.size();
    assert(n >= m);
    string res = "";
    for (int i = 0, carry = 0; i < n; i++) {
        int a = s[n - 1 - i] - '0', b = (i < m ? t[m - 1 - i] - '0' : 0);
        a += carry;
        if (a < b) {
            res += char('0' + (a + 10 - b));
            carry = -1;
        } else {
            res += char('0' + (a - b));
            carry = 0;
        }
    }
    while (res.size() > 1 and res.back() == '0') res.pop_back();
    reverse(res.begin(), res.end());
    return res;
}

void solve() {
    string S;
    cin >> S;

    int n = S.size();
    for (int i = 1; i < 10; i++) {
        for (int len : {n, n - 1}) {
            string A(len, char('0' + i));
            if (len == n and A >= S) continue;
            auto B = sub(S, A);
            if (B == "0") continue;
            int mask = 0;
            for (char& c : B) mask |= 1 << (c - '0');
            if (__builtin_popcount(mask) == 1) {
                cout << A << ' ' << B << '\n';
                return;
            }
        }
    }

    assert(false);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    for (; t--;) solve();
    return 0;
}