#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> pa(n);
  for (int i = 0; i < n; i++) {
    cin >> pa[i];
  }
  vector<int> ha(n);
  for (int i = 0; i < n; i++) {
    cin >> ha[i];
  }
  vector<int> pb(n);
  for (int i = 0; i < n; i++) {
    cin >> pb[i];
  }
  vector<int> hb(n);
  for (int i = 0; i < n; i++) {
    cin >> hb[i];
  }
  vector<int> order_a(n);
  iota(order_a.begin(), order_a.end(), 0);
  sort(order_a.begin(), order_a.end(), [&](int i, int j) {
    return pa[i] < pa[j];
  });
  vector<int> order_b(n);
  iota(order_b.begin(), order_b.end(), 0);
  sort(order_b.begin(), order_b.end(), [&](int i, int j) {
    return pb[i] < pb[j];
  });
  vector<int> res_a;
  vector<int> res_b;
  set<pair<int, int>> st_a;
  set<pair<int, int>> st_b;
  int ptr_a = 0;
  int ptr_b = 0;
  while ((!st_a.empty() || ptr_a < n) && (!st_b.empty() || ptr_b < n)) {
    if (st_a.empty()) {
      int id = ptr_a;
      while (ptr_a < n && pa[order_a[ptr_a]] == pa[order_a[id]]) {
        st_a.emplace(ha[order_a[ptr_a]], order_a[ptr_a]);
        ptr_a += 1;
      }
    }
    if (st_b.empty()) {
      int id = ptr_b;
      while (ptr_b < n && pb[order_b[ptr_b]] == pb[order_b[id]]) {
        st_b.emplace(hb[order_b[ptr_b]], order_b[ptr_b]);
        ptr_b += 1;
      }
    }
    if (int(st_a.size()) < int(st_b.size())) {
      for (auto& p : st_a) {
        int h = p.first;
        int id = p.second;
        auto it = st_b.lower_bound({h, -1});
        if (it == st_b.begin()) {
          break;
        }
        it = prev(it);
        res_a.push_back(id);
        res_b.push_back(it->second);
        st_b.erase(it);
      }
      st_a.clear();
    } else {
      for (auto& p : st_b) {
        int h = p.first;
        int id = p.second;
        auto it = st_a.lower_bound({h + 1, -1});
        if (it == st_a.end()) {
          break;
        }
        res_a.push_back(it->second);
        res_b.push_back(id);
        st_a.erase(it);
      }
      st_b.clear();
    }
  }
  if (int(res_a.size()) != n || int(res_b.size()) != n) {
    cout << "impossible" << '\n';
  } else {
    for (int i = 0; i < n; i++) {
      cout << res_a[i] + 1 << " ";
    }
    cout << '\n';
    for (int i = 0; i < n; i++) {
      cout << res_b[i] + 1 << " ";
    }
    cout << '\n';
  }
  return 0;
}