#include <iostream>
#include <vector>
#include <algorithm>

#define pb push_back
#define fi first
#define se second

using namespace std;

int main(){
    int n, m, tmp, sum = 0;
    cin >> n;
    vector< pair<int, int> > a(n);
    vector< pair<int, int> > b(n);
    for (int i = 0; i < n; i++){
        cin >> tmp;
        a[i] = make_pair(tmp, i);
    }
    for (int i = 0; i < n; i++){
        cin >> tmp;
        b[i] = make_pair(tmp, i);
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end(), greater< pair <int, int> >());
    vector <int> res(n);
    for (int i = 0; i < n; i++)
        res[a[i].se] = b[i].se;
    for (int &v : res)
        cout << v+1 << " ";
}