#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
//#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vi vector<ll>
#define vii vector<pair<int,int>>
#define ti tuple<ll,ll,ll>
#define ff first 
#define ss second
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define repd(i,a,b) for(ll i=(a)-1; i!=(b)-1; i--)
#define all(x) x.begin(),x.end()
#define sz(a) ((int) (a).size())
#define nl '\n'
#define cma <<','<<
ll mod = 1e9 + 7;
ll inf = 1e18;
const ll maxn = 1e5 + 5;
const ll lg = 30;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//uniform_int_distribution<> dist(1, 2);
//inline ll gen_random(ll l, ll r) {
//    return uniform_int_distribution<ll>(l, r)(rng);
//}

void print(vector<int>& v){
	for(int i = sz(v) - 1; i >= 0; i--){
		cout << v[i];
	}
}

ll modpow(ll b, ll e) {
	ll ans = 1;
	for (; e; b = b * b % mod, e /= 2)
		if (e & 1) ans = ans * b % mod;
	return ans;
}

vector<int> sub(vector<int> n, vector<int> a){
	int len = sz(n);
	vector<int> b(len);
	
	while(sz(a) < len){
		a.pb(0);
	}
	
	for(int i = len - 1; i >= 0; i--){
		if(n[i] > a[i]) break;
		if(a[i] > n[i]) return {-1};
	} 
	
	for(int i = 0; i < len; i++){
		if(n[i] >= a[i]){
			b[i] = n[i] - a[i];
			continue;
		}
		int j = i + 1;
		while(n[j] == 0) j++;
		n[j]--;
		for(int k = j - 1; k >= i + 1; k--){
			n[k] = 9;
		}
		n[i] += 10;
		b[i] = n[i] - a[i];
	}
	
	return b;
}

bool checkrep(vector<int>& b){
	int len = sz(b);
	while(b[len - 1] == 0){
		b.pop_back();
		len--;
	}
	bool ok = true;
	for(int i = 1; i < len; i++){
		ok &= (b[i] == b[0]);
	}
	return ok;
}

void solve(){
	string s; cin >> s;
	int len = sz(s);
	vector<int> n(len);
	rep(i,0,len){
		n[i] = s[len - i - 1] - '0';
	}
	
	for(int l = max(1, len - 1); l <= len; l++){
		for(int d = 1; d <= 9; d++){
			vector<int> a(l, d);
			vector<int> b = sub(n, a);
		
			if(b[0] == -1) continue;
			if(checkrep(b)){
				print(a);
				cout << " ";
				print(b);
				cout << nl;
				return;
			}
		}
	}
	
	
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);

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

/*
1
2 2
2 0




*/