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

using ll = long long;
using ull = unsigned long long;

string to_string(const string &s) {
  return '"' + s + '"';
}

string to_string(bool b) {
  return b ? "true" : "false";
}

template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename T>
string to_string(const T &v) {
  string s = "{";
  bool first = true;
  for (const auto &it : v) {
    if (!first)
      s += ", ";
    else
      first = false;
    s += to_string(it);
  }
  return s += "}";
}

void debug_out() {
  cerr << endl;
}

template <typename T, typename... Args>
void debug_out(const T &first, const Args&... rest) {
  cerr << to_string(first) << " ";
  debug_out(rest...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

auto startTime = high_resolution_clock::now();
int get_time() {
  auto stopTime = chrono::high_resolution_clock::now();
  auto duration = duration_cast<milliseconds>(stopTime - startTime);
  return duration.count(); // in ms
}

void print_cif(int x, int n) {
  for (int i = 0; i < n; ++i)
    cout << x;
}

void print_cifs(int x, int n, int y, int n2) {
  print_cif(x, n);
  cout << " ";
  print_cif(y, n2);
  cout << '\n';
}

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

  if (s.size() == 1) {
    int x = s[0] - '0';
    cout << 1 << " " << x - 1 << '\n';
    return;
  }

  if (s.size() <= 6) {
    int sum = 0;
    for (int i = 0; i < s.size(); ++i)
      sum = sum * 10 + s[i] - '0';

    for (int x = 1; x <= 9; ++x) {
      int a = 0;
      for (int l1 = 1; l1 <= s.size(); ++l1) {
        a = a * 10 + x;
        for (int y = 1; y <= 9; ++y) {
          int b = 0;
          for (int l2 = 1; l2 <= s.size(); ++l2) {
            b = b * 10 + y; 
            if (a + b == sum) {
              cout << a << " " << b << '\n';
              return;
            }
          }
        }
      }
    }
  }

  vector<pair<int, int>> v;
  for (int i = 0; i < s.size(); ++i) {
    if (i + 1 == s.size() || s[i + 1] != s[i])
      v.push_back({s[i] - '0', i});
  }

  if (v.size() == 1) {
    int x = s[0] - '0';

    print_cifs(1, s.size(), x - 1, s.size());
    return;
  }

  if (v.size() == 2) {
    if (s[0] == '1' && s[1] == '0') {
      print_cif(9, s.size() - 1);
      cout << " ";
      print_cif(1, 1);
      cout << '\n';
      return;
    }


    int sum = v.back().first;
    int x = s[0] - '0';

    int y = sum - x;
    print_cifs(x, s.size(), y, s.size() - v[0].second - 1);
    return;
  }

  if (v[0].first == 1 && v[1].first == 0) {
    int sum = v.back().first + 10;
    int x = 9;
    int y = sum - 9;
    print_cifs(x, s.size() - 1, y, s.size() - v[1].second - 1);
    return;
  }

  if (v[0].first == 1) {
    int sum = v.back().first + 10;
    int x = 9;
    int y = sum - 9;
    print_cifs(x, s.size() - 1, y, s.size() - 1);
    return;
  }

  if (v.size() == 4) {
    int sum = v.back().first + 10;
    int x = v[0].first;
    int y = sum - x;
    print_cifs(x, s.size(), y, s.size() - v[1].second - 1);
    return;
  }

  if (s[0] != s[1]) {
    int x = v[0].first - 1;
    int y = v.back().first - x;
    if (y < 0)
      y += 10;
    print_cifs(x, s.size(), y, s.size() - 1);
    return;
  }

  if (s[s.size() - 1] != s[s.size() - 2]) {
    int x = v[0].first;
    int y = v.back().first - x;
    if (y < 0)
      y += 10;
    print_cifs(x, s.size(), y, 1);
    return;
  }

  assert(1 == 0);
}

int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);

  int t = 1;
  cin >> t;
  while (t--)
    solve();

  return 0;
}