#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using pill = pair<int, ll>;
using vvi = vector<vi>;
ll gcd(ll a, ll b) {
  ll t;
  while ((t = a % b) != 0) {
    a = b;
    b = t;
  }
  return b;
}
ll fast_exp(ll base, ll n, ll m) {
  if (n == 0) return 1;
  ll t = fast_exp(base, n / 2, m);
  if (n % 2 == 0)
    return (t * t) % m;
  else
    return (((t * t) % m) * base) % m;
}
bool is_set(int i, ll mask) { return (mask >> i) & 1; }
int count_bits(ll mask) {
  int ans = 0;
  for (int i = 0; i < 64; ++i)
    if (is_set(i, mask)) ++ans;
  return ans;
}
int first_bit(ll mask) {
  int i = 0;
  while (i < 64)
    if (is_set(i++, mask)) return i - 1;
  return -1;
}
int const N = 2e5;
ll b[N], a[N];
bool foo(int i, int j) { return b[i] < b[j]; }
bool bar(ll i, ll j) { return i > j; }
int main() {
  ios::sync_with_stdio(false);
  int m;
  cin >> m;
  multiset<ll, bool (*)(ll, ll)> s(bar);
  for (int i = 0; i < m; ++i) cin >> a[i], s.insert(a[i]);
  for (int i = 0; i < m; ++i) cin >> b[i];
  vi v(m);
  iota(v.begin(), v.end(), 0);
  sort(v.begin(), v.end(), foo);
  for (auto x : v) {
    a[x] = *s.begin(), s.erase(s.begin());
  }
  for (int i = 0; i < m; ++i) cout << a[i] << " ";
  cout << "\n";
  return 0;
}
