#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
struct ds {
  int x, vt;
};
ds a[N], b[N], c[N];
int n;
bool cmp1(ds a, ds b) { return (a.x < b.x) || ((a.x == b.x) && (a.vt < b.vt)); }
bool cmp2(ds a, ds b) { return (a.x > b.x) || ((a.x == b.x) && (a.vt < b.vt)); }
bool cmp3(ds a, ds b) { return a.vt < b.vt; }
void nhap() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].x);
    a[i].vt = i;
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &b[i].x);
    b[i].vt = i;
  }
}
void solve() {
  sort(a + 1, a + 1 + n, cmp1);
  sort(b + 1, b + 1 + n, cmp2);
  for (int i = 1; i <= n; i++) {
    c[i].x = a[i].x;
    c[i].vt = b[i].vt;
  }
  sort(c + 1, c + 1 + n, cmp3);
  for (int i = 1; i <= n; i++) {
    printf("%d ", c[i]);
  }
}
int main() {
  nhap();
  solve();
}
