#include <bits/stdc++.h>
#define N 500005
#define Ms(a,b) memset(a,b,sizeof a)
#define db(x) cerr<<#x<<"="<<x<<endl;
#define db2(x,y) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<endl;
#define db3(x,y,z) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<endl;
using namespace std;
int rd() {
    int res = 0, c;

    while (c = getchar(), c < 48);

    do
        res = (res << 1) + (res << 3) + (c ^ 48);

    while (c = getchar(), c >= 48);

    return res;
}
struct node {
    int x, v, h;
    bool operator <(const node &b)const {
        return h < b.h;
    }
} a[N], b[N];
struct cmp {
    bool operator()(const node &a, const node &b)const {
        return a.v < b.v;
    }
};
int n, r1[N], r2[N];
multiset<node>st1, st2;
multiset<node>::iterator it, cur;
int main() {
    n = rd();

    for (int i = 1; i <= n; i++)
        a[i].v = rd();

    for (int i = 1; i <= n; i++)
        a[i].h = rd(), a[i].x = i;

    for (int i = 1; i <= n; i++)
        b[i].v = rd();

    for (int i = 1; i <= n; i++)
        b[i].h = rd(), b[i].x = i;

    sort(a + 1, a + 1 + n, cmp());
    sort(b + 1, b + 1 + n, cmp());
    int s = 1, t1 = 0, t2 = 0;

    while (s <= n) {
        if (t1 < s) {
            st1.insert(a[s]), t1 = s;

            while (t1 < n && a[t1].v == a[t1 + 1].v)
                st1.insert(a[++t1]);
        }

        if (t2 < s) {
            st2.insert(b[s]), t2 = s;

            while (t2 < n && b[t2].v == b[t2 + 1].v)
                st2.insert(b[++t2]);
        }

        if (t1 <= t2) {
            for (cur = st1.begin(); cur != st1.end(); cur++) {
                it = st2.lower_bound(*cur);

                if (it == st2.begin())
                    return puts("impossible"), 0;
                else
                    it--;

                r1[s] = cur->x, r2[s] = it->x, ++s;
                st2.erase(it);
            }

            st1.clear();
        } else {
            for (cur = st2.begin(); cur != st2.end(); cur++) {
                it = st1.upper_bound(*cur);

                if (it == st1.end())
                    return puts("impossible"), 0;

                r1[s] = it->x, r2[s] = cur->x, ++s;
                st1.erase(it);
            }

            st2.clear();
        }
    }

    for (int i = 1; i <= n; i++)
        printf("%d%c", r1[i], " \n"[i == n]);

    for (int i = 1; i <= n; i++)
        printf("%d%c", r2[i], " \n"[i == n]);

    return 0;
}