/* -*- coding: utf-8 -*-
 *
 * 610.cc: No.610 区間賞(Section Award) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

typedef pair<int,int> pii;

/* global variables */

int as[MAX_N], bs[MAX_N], ans[MAX_N];
pii cs[MAX_N];

/* subroutines */

void readv(int n, int as[]) {
  for (int i = 0; i < n; i++) {
    int ai;
    scanf("%d", &ai);
    ai--;
    as[ai] = i;
  }
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  readv(n, as);
  readv(n, bs);
  //for (int i = 0; i < n; i++) printf("(%d %d)", as[i], bs[i]);
  //putchar('\n');

  for (int i = 0; i < n; i++) cs[as[i]] = pii(bs[i], i);
  //for (int i = 0; i < n; i++) printf("(%d %d)", cs[i].first, cs[i].second);
  //putchar('\n');

  int m = 0, minc = n;
  for (int i = n - 1; i >= 0; i--) {
    int &c = cs[i].first, &k = cs[i].second;
    if (minc > c) ans[m++] = k, minc = c;
  }
  sort(ans, ans + m);

  for (int i = 0; i < m; i++) printf("%d\n", ans[i] + 1);

  return 0;
}