#include <bits/stdc++.h>
using namespace std;
struct sort_pred {
  bool operator()(const std::pair<int, int> &left,
                  const std::pair<int, int> &right) {
    return right.first > left.first;
  }
};
int n, m, k, t;
int r = 0;
vector<bool> visited;
vector<vector<int>> v;
vector<int> distanc;
queue<int> q;
map<pair<int, int>, int> mp;
vector<bool> chosen;
void bfs(int first) {
  visited[first] = true;
  q.push(first);
  while (!q.empty()) {
    int s = q.front();
    q.pop();
    for (auto u : v[s]) {
      if (distanc[s] - mp[make_pair(s, u)] >= 0 &&
          distanc[s] - mp[make_pair(s, u)] > distanc[u]) {
        if (!visited[u]) r++;
        visited[u] = true;
        distanc[u] = distanc[s] - mp[make_pair(s, u)];
        if (chosen[u]) distanc[u] = t;
        q.push(u);
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  map<int, int> mp;
  vector<int> b(n);
  for (int i = 0; i < n; i++) {
    int first;
    cin >> first;
    mp[first] = i + 1;
  }
  for (int i = 0; i < n; i++) {
    int first;
    cin >> first;
    cout << mp[first] << " ";
  }
}
