#include<bits/stdc++.h>
using namespace std;




const int maxn = 5e5+5;
struct D {
    int p, h, idx;
} bck[maxn], frnt[maxn];

bool cmp(const D &a, const D &b) {
    if (a.p == b.p) {
        return a.h > b.h;
    }
    return a.p < b.p;
}
void solve(int cs){
    int n, x;
    cin>>n;
    for (int i = 1; i <= n; i++) {
        cin>>x;
        bck[i].p = x;
    }
    for (int i = 1; i <= n; i++) {
        cin>>x;
        bck[i].h = x;
        bck[i].idx = i;
    }
    for (int i = 1; i <= n; i++) {
        cin>>x;
        frnt[i].p = x;
    }
    for (int i = 1; i <= n; i++) {
        cin>>x;
        frnt[i].h = x;
        frnt[i].idx = i;
    }
    sort(bck+1, bck+n+1, cmp);
    sort(frnt+1, frnt+n+1, cmp);
    int f = 0;
    for (int i = 1; i<= n; i++) {
        if (bck[i].h <= frnt[i].h) {
            f = 1;
            break;
        }
    }
    if (f == 1) {
        cout<<"impossible\n";
        return;
    }
    for (int i = 1; i<=n; i++) {
        cout<<bck[i].idx<<" ";
    }
    cout<<"\n";
    for (int i = 1; i<=n; i++) {
        cout<<frnt[i].idx<<" ";
    }
    cout<<"\n";
}


int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int t;t=1;
    //cin>>t;
    for(int cs=1;cs<=t;cs++)solve(cs);
    return 0;
}