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

using ll = long long;
using pii = pair<int, int>;

string dif(string &u, string &v) {
	if (size(u) < size(v)) {
		return "12";
	}
	int nu = size(u);
	int nv = size(v);
	string ret = u;
	for (int i = 0; i < nu; i++) {
		if (nv - 1 - i < 0) {
		}
		else {
			ret[nu - 1 - i] -= (v[nv - 1 - i] - '0');
		}
		if (ret[nu - 1 - i] < '0' && nu - 1 - i > 0) {
			ret[nu - 1 - i] += 10;
			ret[nu - 1 - i - 1]--;
		}
	}
	if (ret[0] < '0') return "12";
	else return ret;
}

bool isrep(string &s) {
	int n = s.size();
	bool f = false;
	char ch;
	for (int i = 0; i < n; i++) {
		if (!f && s[i] != '0') {
			f = true;
			ch = s[i];
		}
		if (f) {
			if (s[i] != ch) return false;
		}
	}
	if (!f) return false;
	return true;
}

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

	int n = (int)s.size();

	for (int i = max(n - 1, 1); i <= n; i++) {
		for (int j = 1; j <= 9; j++) {
			string sa = "";
			for (int k = 0; k < i; k++) {
				sa += '0' + j;
			}
			string sb = dif(s, sa);
			if (isrep(sb)) {
				cout << sa << " ";
				for (auto x: sb) if (x != '0') cout << x;
				cout << "\n";
				return;
			}
		}
	}
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}	
}