#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

void solve() {
    int n;
    cin >> n;
    vector<int> v(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    string ans;
    for (int i = n; i >= 1; i--) {
        int p = i;
        vector<int> idx;
        while (p > 0) {
            idx.emplace_back(p);
            if (a[p] == v[i]) {
                break;
            }
            p /= 2;
        }
        if (p == 0) {
            cout << "Impossible\n";
            return;
        }
        if (p == i) {
            ans += '0';
            continue;
        }
        int mn = 1;
        int mx = -1;
        for (int j = (int)idx.size() - 1; j > 0; j--) {
            int x = idx[j];
            int y = idx[j - 1];
            //cerr << x << " " << y << "\n";
            if (a[x] > a[y]) {
                mn = min(mn, -1);
                mx = max(mx, -1);
            } else {
                mn = min(mn, 1);
                mx = max(mx, 1);
            }
            swap(a[x], a[y]);
        }
        if (mn != mx) {
            cout << "Impossible\n";
            return;
        }
        if (mn == -1) {
            ans += '1';
        } else {
            ans += '0';
        }
    }
    reverse(ans.begin(), ans.end());
    cout << ans << "\n";
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

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

    return 0;
}