#include<bits/stdc++.h>
using namespace std;
const int maxv=10010;
int in_order[maxv],post_order[maxv],pre_order[maxv],lch[maxv],rch[maxv];
int n;
bool read_list(int* a){
	string line;
	if(!getline(cin,line)) return false;
	stringstream ss(line);
	n=0;
	int x;
	while(ss>>x) a[n++]=x;
	return n>0;
}
int build(int L1,int R1,int L2,int R2){
	if(L1>R1) return 0;
	int root=post_order[R2];
	int p=L1;
	while(in_order[p]!=root) p++;
	int cnt=p-L1;
	lch[root]=build(L1,p-1,L2,L2+cnt-1);
	rch[root]=build(p+1,R1,L2+cnt,R2-1);
	return root;
}
int preorder(int root){
	if(root==0)return 0;
	pre_order[root]=root;
	preorder(lch[root]);
	preorder(rch[root]);
	return 1;
}
int main(){
	if(!read_list(in_order)&&!read_list(post_order)) return 0;
	int root=build(0,n-1,0,n-1);
	preorder(root);
	for(int i=1;i<=n;i++) cout<<pre_order[i]<<endl;
}

看不出哪错了QwQ