#include <iostream>
#include <algorithm>
#include <vector>
 
using namespace std;

int main() {
  int n;
  cin >> n;

  vector<int> a(n), b(n);
  for (int i = 0; i < n; i++) cin >> a[i], a[i]--;
  for (int i = 0; i < n; i++) cin >> b[i], b[i]--;

  vector<int> inv(n);
  for (int i = 0; i < n; i++) inv[a[i]] = i;

  vector<int> ans;
  int mx = -1;
  for (int i = 0; i < n; i++) {
    if (mx < inv[b[i]]) {
      ans.push_back(b[i]);
    }
    mx = max(mx, inv[b[i]]);
  }

  sort(ans.begin(), ans.end());
  for (int i : ans) {
    cout << i + 1 << endl;
  }
}