#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;

int n, ford[500005], bord[500005];
pii fr[500005], ba[500005];
int sol[500005][2];

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> ba[i].F;
    for (int i = 1; i <= n; i++)
        cin >> ba[i].S;
    for (int i = 1; i <= n; i++)
        cin >> fr[i].F;
    for (int i = 1; i <= n; i++)
        cin >> fr[i].S; 
    iota(ford, ford + 1 + n, 0);
    sort(ford + 1, ford + 1 + n, [&](int i, int j) { return fr[i] < fr[j]; });
    iota(bord, bord + 1 + n, 0);
    sort(bord + 1, bord + 1 + n, [&](int i, int j) { return ba[i] < ba[j]; });
    multiset<pii, greater<pii>> fst;
    multiset<pii> bst;
    int idx = 1, jdx = 1;
    for (int i = 1; i <= n; )
    {
        if (idx == i)
        {
            int p = fr[ford[idx]].F;
            while (idx <= n && fr[ford[idx]].F == p)
                fst.insert(pii(fr[ford[idx]].S, ford[idx])), ++idx;
        }
        if (jdx == i)
        {
            int p = ba[bord[jdx]].F;
            while (jdx <= n && ba[bord[jdx]].F == p)
                bst.insert(pii(ba[bord[jdx]].S, bord[jdx])), ++jdx;
        }
        if (fst.size() <= bst.size())
        {
            for (auto [f, fi] : fst)
            {
                auto bter = bst.lower_bound(pii(f, n + 1));
                if (bter == bst.end()) goto fail;
                sol[i][0] = bter->S;
                sol[i][1] = fi;
                bst.erase(bter);
                i++;
            }
            fst.clear();
        }
        else 
        {
            for (auto [b, bi] : bst)
            {
                auto fter = fst.lower_bound(pii(b, 0));
                if (fter == fst.end()) goto fail;
                sol[i][0] = bi;
                sol[i][1] = fter->S;
                fst.erase(fter);
                i++;
            }
            bst.clear();
        }
    }
    for (int i = 1; i <= n; i++)
        cout << sol[i][0] << " \n"[i == n];
    for (int i = 1; i <= n; i++)
        cout << sol[i][1] << " \n"[i == n];

    return 0;
    fail:
    cout << "impossible\n";
    return 0;
}