#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int inv(int x) {
    return bp(x, mod - 2);
}

int n, a[N], h[N], H[N];
bool ans[N];

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        cin >> h[i];
    for (int i = 1; i <= n; i++)
        H[i] = h[i];
    for (int i = n; i >= 1; i--) {
        int j = i;
        bool found = false;
        int mn = 2e9, mx = -2e9;
        while (j >= 1) {
            if (a[i] == h[j]) {
                found = true;
                break;
            }
            mn = min(mn, h[j]);
            mx = max(mx, h[j]);
            j /= 2;
        }
        if (!found) {
            cout << "Impossible\n";
            return;
        }
        if(j == 1 || h[j / 2] == a[i]){
            if (a[i] < mn) {
                ans[i] = 0;
                int q = i;
                int lst = -1;
                while (true) {
                    swap(h[q], lst);
                    if (q == j)
                        break;
                    q /= 2;
                }
                continue;
            }
            if (a[i] > mx) {
                ans[i] = 1;
                int q = i;
                int lst = -1;
                while (true) {
                    swap(h[q], lst);
                    if (q == j)
                        break;
                    q /= 2;
                }
                continue;
            }
        }else{
            if (h[j / 2] < a[i]) {
                ans[i] = 0;
                int q = i;
                int lst = -1;
                while (true) {
                    swap(h[q], lst);
                    if (q == j)
                        break;
                    q /= 2;
                }
                continue;
            }
            if (h[j / 2] > a[i]) {
                ans[i] = 1;
                int q = i;
                int lst = -1;
                while (true) {
                    swap(h[q], lst);
                    if (q == j)
                        break;
                    q /= 2;
                }
                continue;
            }
        }
        cout << "Impossible\n";
        return;
    }
    for (int i = 1; i <= n; i++) {
        h[i] = a[i];
        int j = i;
        while (j > 1) {
            if (ans[i] == false && h[j / 2] <= h[j])
                break;
            if (ans[i] == true && h[j / 2] >= h[j])
                break;
            swap(h[j], h[j / 2]);
            j /= 2;
        }
    }

    for (int i = 1; i <= n; i++)
        if (h[i] != H[i]) {
            cout << "Impossible\n";
            return;
        }

    for (int i = 1; i <= n; i++)
        cout << ans[i];
    cout << "\n";
}

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}