#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

struct Big: vector<signed> {
    static const int BASE = 1e9;
#define me (*this)
    bool shrink(){return !empty() && !back() && (pop_back(), 1);}
    auto get(int i) const { return i < sz(me) ? me[i] : 0; }
    Big() {}
    Big(auto val) { while (val) pb(val % BASE), val /= BASE; }
    Big(const string& s) {
        for (int i = sz(s); i > 0; i -= 9)
            pb(stoi(i < 9 ? s.substr(0, i) : s.substr(i - 9, 9)));
        while(shrink());
    }
    void print(ostream& out) const {
        out << (empty() ? 0 : back());
        for (int i = sz(me) - 2; i >= 0; i--)
            out << setw(9) << setfill('0') << me[i];
    }
    auto operator<=>(const Big& oth) const {
        if (auto res = sz(me) <=> sz(oth); res != 0) return res;
        for (int i = sz(me) - 1; i >= 0; i--)
            if (auto res = me[i] <=> oth[i]; res != 0) return res;
        return 0 <=> 0;
    }
#define pm(op, tp, init, check, end, add, cmp, inv, last) \
		Big& operator op(const tp& oth) { \
			for (int i = 0, r = init; check || r; i++) { \
				if (i == size()) end(0); \
				me[i] op r + add; \
				if (r = me[i] cmp) me[i] inv BASE; \
			} \
			last; return me; \
		}
    pm(+=, int, oth, 0, pb, 0, >= BASE, -=, )
    pm(+=, Big, 0, i < sz(oth), pb, oth.get(i), >= BASE, -=, )
    pm(-=, int, oth, 0, assert, 0, < 0, +=, shrink())
    pm(-=, Big, 0, i < sz(oth), assert, oth.get(i), < 0, +=, while(shrink()))
    Big& operator*=(int oth) {
        if (!oth) clear();
        int r = 0;
        for (auto& e: me) {
            ll cur = e * ll(oth) + r;
            e = cur % BASE; r = cur / BASE;
        }
        if (r) pb(r);
        return me;
    }
    Big operator*(const Big& oth) const {
        if(empty() || oth.empty()) return {};
        Big c; c.resize(sz(me) + sz(oth));
        rep(i, 0, sz(me))
            for (int j = 0, r = 0; j < sz(oth) || r; ++j) {
                ll cur = c[i + j] + me[i] * ll(oth.get(j)) + r;
                c[i + j] = cur % BASE; r = cur / BASE;
            }
        c.shrink(); return c;
    }
    Big& operator*=(const Big& oth) { return me = me * oth; }
    int divmod(int oth) {
        int r = 0;
        for (int i = sz(me) - 1; i >= 0; i--) {
            ll cur = me[i] + (ll) r * BASE;
            me[i] = cur / oth; r = cur % oth;
        }
        shrink(); return r;
    }
    Big& operator/=(int oth) { divmod(oth); return me; }
};
#define def(op, expr) auto operator op(Big a, const auto& b) { return a expr(b); }
def(+, +=) def(-, -=) def(*, *=) def(/, /=) def(%, .divmod)

string to_string(const Big&x)
{
    stringstream ss;
    x.print(ss);
    return ss.str();
}

bool repdig(const string&s)
{
    for(int i=1;i<sz(s);i++)
        if(s[i]!=s[0])
            return false;
    return true;
}

void solve()
{
    string s;
    cin>>s;
    Big n(s);
    for(int d=1;d<10;d++)
    {
        Big a;
        for(int i=0;i<max<int>(1,sz(s)-1);i++)
            a=a*10+d;
        if(a<n)
        {
            string b=to_string(n-a);
            if(repdig(b))
            {
                a.print(cout);
                cout<<" "<<b<<"\n";
                return;
            }
        }
        a=a*10+d;
        if(a<n)
        {
            string b=to_string(n-a);
            if(repdig(b))
            {
                a.print(cout);
                cout<<" "<<b<<"\n";
                return;
            }
        }
    }
    cout<<-1<<"\n";
    assert(0);
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

    int t;
    cin>>t;
    while(t--)
        solve();
}