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

#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()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

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

  int tt;
  cin >> tt;
  while(tt--) {
    string s;
    cin >> s;
    reverse(s.begin(), s.end());
    int n = s.size();
    string ansa, ansb;
    for (int x = 1; x <= 9; x++) {
      for (int y = 1; y <= 9; y++) {
        int carry = 0;
        bool end_b = false, end_a = false, ok = true;
        string a, b;
        for (int i =0; i < n; i++) {
          int d = s[i] - '0';
          if (!end_b && (x + y + carry)%10 == d) {
            carry = (x + y + carry)/10;
            a.push_back('0'+x);
            b.push_back('0'+y);
          } else if (!end_a && (x + carry)%10 == d) {
            end_b = true;
            carry = (x+carry)/10;
            a.push_back('0'+x);
          } else if (carry == d) {
            end_a = end_b = true;
            carry = 0;
          } else {
            ok = false;
            break;
          }
        }
        if (ok) {
          ansa = a;
          ansb = b;
          goto end;
        }
      }
    }
    assert(false);
  end:;
    cout << ansa << " " << ansb << '\n';
  }
}