#include <bits/stdc++.h>
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
ll gcd(ll n, ll m) {
  ll tmp;
  while (m != 0) {
    tmp = n % m;
    n = m;
    m = tmp;
  }
  return n;
}
ll lcm(ll n, ll m) { return abs(n) / gcd(n, m) * abs(m); }
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
using namespace std;
void solve() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    string s;
    cin >> s;
    string a = "", b = "";
    for (int i = (int)0; i < (int)n; ++i) {
      if (s[i] == '0') a += '0', b += '0';
      if (s[i] == '1') a += '1', b += '0';
      if (s[i] == '2') a += '1', b += '1';
    }
    bool flag = false;
    for (int i = (int)0; i < (int)n; ++i) {
      if (!flag && a[i] > b[i]) {
        flag = true;
        continue;
      }
      if (flag) {
        if (a[i] == '1' && b[i] == '1')
          a[i] = '0', b[i] = '2';
        else if (a[i] == '1' && b[i] == '0')
          a[i] = '0', b[i] = '1';
      }
    }
    cout << a << "\n" << b << "\n";
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}
