#include <bits/stdc++.h>
using namespace std;
const int iinf = 1e9 + 7;
const int oo = 0x3f3f3f3f;
const long long linf = 1ll << 60;
const double dinf = 1e60;
template <typename T>
inline void scf(T &x) {
  bool f = 0;
  x = 0;
  char c = getchar();
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') f = 1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  if (f) x = -x;
  return;
}
template <typename T1, typename T2>
void scf(T1 &x, T2 &y) {
  scf(x);
  return scf(y);
}
template <typename T1, typename T2, typename T3>
void scf(T1 &x, T2 &y, T3 &z) {
  scf(x);
  scf(y);
  return scf(z);
}
template <typename T1, typename T2, typename T3, typename T4>
void scf(T1 &x, T2 &y, T3 &z, T4 &w) {
  scf(x);
  scf(y);
  scf(z);
  return scf(w);
}
inline char mygetchar() {
  char c = getchar();
  while (c == ' ' || c == '\n') c = getchar();
  return c;
}
template <typename T>
inline bool chkmax(T &x, const T &y) {
  return y > x ? x = y, 1 : 0;
}
template <typename T>
inline bool chkmin(T &x, const T &y) {
  return y < x ? x = y, 1 : 0;
}
const int maxn = 2e5 + 100;
int n;
int a[maxn], b[maxn], ans[maxn];
pair<int, int> fuck[maxn];
int main() {
  scf(n);
  for (int i = (1), _end_ = (n); i <= _end_; ++i) scf(a[i]);
  for (int i = (1), _end_ = (n); i <= _end_; ++i)
    scf(b[i]), fuck[i] = make_pair(b[i], i);
  sort(fuck + 1, fuck + n + 1);
  sort(a + 1, a + n + 1);
  reverse(a + 1, a + n + 1);
  for (int i = (1), _end_ = (n); i <= _end_; ++i) ans[fuck[i].second] = a[i];
  for (int i = (1), _end_ = (n); i <= _end_; ++i) printf("%d ", ans[i]);
  return 0;
}
