#include<bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int a[100010],b[100010];
struct BinaryIndexedTree{
    vector<int> bit;
    BinaryIndexedTree(int siz){
        bit.assign(++siz,0);
    }

    int sum(int k){
        int ret=0;
        for(++k;k>0;k-=k&-k){
            ret+=bit[k];
        }
        return ret;
    }

    void add(int k,int x){
        for(++k;k<bit.size();k+=k&-k){
            bit[k]+=x;
        }
    }
};
int main(){
	int n;cin>>n;
	map<int,int> mp;
	BinaryIndexedTree bit(n+1);
	for(int i=0;i<n;i++){
		cin>>a[i];
		mp[a[i]]=i+1;
	}
	for(int j=0;j<n;j++){
		cin>>b[j];
	}
	vector<int> ans;
	for(int i=0;i<n;i++){
		if(bit.sum(n)-bit.sum(mp[b[i]])==0){
			ans.push_back(b[i]);
		}
		bit.add(mp[b[i]],1);
	}
	sort(all(ans));
	for(auto a:ans){
		cout<<a<<endl;
	}
	return 0;
}