#include <bits/stdc++.h>
#ifdef LOCAL
#include "cp_debug.h"
#else
#define debug(...) 42
#endif
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

template<typename T> void read(T &x){
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) {
    read(first);
    read(args...);
}
template<typename T> void write(T x) {
    if(x > 9) write(x/10);
    putchar(x%10 + '0');
}

vector<vector<pii>> get_groups(vector<tuple<int,int,int>> a) {
    int last_price = -1;
    vector<pii> last_group;
    vector<vector<pii>> ans;
    debug(a);
    for(auto [price, height, idx]: a){
        if(price != last_price) {
            if(sz(last_group) > 0) {
                ans.emplace_back(last_group);
                last_group.clear();
            }
            last_price = price;
        }
        last_group.emplace_back(height, idx);
    }
    if(sz(last_group) > 0) {
        ans.emplace_back(last_group);
    }
    return ans;
}

const int INF = 0x3f3f3f3f;
void solve() {
    int n;
    read(n);
    vector<tuple<int,int,int>> front(n), back(n);
    rep(i,0,n) read(get<0>(back[i]));
    rep(i,0,n) read(get<1>(back[i]));
    rep(i,0,n) read(get<0>(front[i]));
    rep(i,0,n) read(get<1>(front[i]));
    rep(i,0,n) {
        get<2>(back[i])=i;
        get<2>(front[i])=i;
    }
    sort(all(front));
    sort(all(back));

    vector<vector<pii>> back_groups = get_groups(back);
    vector<vector<pii>> front_groups = get_groups(front);

    debug(back_groups);
    debug(front_groups);

    vi ans_front(n, -1), ans_back(n, -1);
    set<pii> cfront, cback;
    int completed = 0, fg_id = 0, bg_id = 0;
    while(completed < n) {
        if(cfront.empty()) {
            assert(fg_id < sz(front_groups));
            for(auto p: front_groups[fg_id]) {
                cfront.insert(p);
            }
            fg_id++;
        }
        if(cback.empty()) {
            assert(bg_id < sz(back_groups));
            for(auto p: back_groups[bg_id]) {
                cback.insert(p);
            }
            bg_id++;
        }
        debug(cfront, cback);
        if(sz(cfront) <= sz(cback)) {
            while(cfront.size()) {
                debug("1",completed,cfront, cback);
                auto [val, pos] = *cfront.begin();
                cfront.erase(cfront.begin());
                auto it = cback.upper_bound({val, INF});
                if(it == cback.end()) {
                    debug(val,pos,"GG");
                    cout<<"impossible"<<'\n';
                    return;
                } else {
                    debug(val,pos,"matched", it->first,it->second);
                    ans_front[completed] = pos;
                    ans_back[completed] = it->second;
                    assert(it->first > val);
                    cback.erase(it);
                    completed++;
                }
            }
        } else {
            while(cback.size()) {
                debug("2",completed,cfront, cback);
                auto [val, pos] = *cback.begin();
                cback.erase(cback.begin());
                auto it = cfront.lower_bound({val, -INF});
                if(it == cfront.begin()) {
                    debug(val,pos,"cannot go before begin");
                    cout<<"impossible"<<'\n';
                    return;
                }
                --it;
                debug(val,pos,"matcheD", it->first,it->second);
                ans_front[completed] = it->second;
                ans_back[completed] = pos;
                assert(val > it->first);
                cfront.erase(it);
                completed++;
            }
        }
    }
    rep(i,0,n) cout<<(ans_back[i]+1)<<" \n"[i==n-1];
    rep(i,0,n) cout<<(ans_front[i]+1)<<" \n"[i==n-1];
}

signed main() {
    int T; T = 1;
    while(T--) solve();
    return 0;
}