#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int L;
char S[4010];

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%s", S);
    L = strlen(S);
    
    vector<int> A(L + 1, 0);
    for (int i = 0; i < L; ++i) {
      A[i] = S[L - 1 - i] - '0';
    }
    
    // larger len
    for (const int len : {L, L - 1}) {
      for (int x = 1; x < 10; ++x) {
        auto cs = A;
        for (int i = 0; i < len; ++i) {
          cs[i] -= x;
        }
        for (int i = 0; i < L; ++i) {
          for (; cs[i] <   0; cs[i] += 10, cs[i + 1] -= 1) {}
          for (; cs[i] >= 10; cs[i] -= 10, cs[i + 1] += 1) {}
        }
        if (cs[L] == 0) {
          for (int k = L; --k >= 0; ) if (cs[k]) {
            const int y = cs[k];
            bool same = true;
            for (int i = 0; i <= k; ++i) {
              same = same && (cs[i] == y);
            }
            if (same) {
              printf("%s %s\n", string(len, '0' + x).c_str(), string(k + 1, '0' + y).c_str());
              goto found;
            }
            break;
          }
        }
      }
    }
    assert(false);
   found:{}
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}