#include <bits/stdc++.h>

using namespace std;
using LL = long long int;

const int MAX_N = 100005;

int N;
int A[MAX_N], B[MAX_N];
int AIndex[MAX_N];

int main()
{
  cin >> N;
  for(int i = 0; i < N; i++) {
    cin >> A[i];
    AIndex[A[i]] = i;
  }
  for(int i = 0; i < N; i++) {
    cin >> B[i];
  }


  int ansIndex = 0;
  vector<int> ansList;
  for(int i = 0; i < N; i++) {
    if(AIndex[B[i]] < ansIndex) {
      continue;
    } else {
      ansIndex = AIndex[B[i]];
      ansList.push_back(B[i]);
    }
  }

  sort(begin(ansList), end(ansList));
  for(int ans : ansList) {
    cout << ans << endl;
  }

  return 0;
}