#include<stdio.h>
#include<stdlib.h>
int a[31], b[31];
typedef struct treeNode* tree;
struct treeNode
{
int data;
tree left, right;
};
tree creat()
{
tree p = (tree)malloc(sizeof(tree));
p->left = p->right = NULL;
return p;
}
tree find(int z1, int x1, int x2)
{
int i;
tree head = creat();
head->data = a[z1];
for (i = x1; i <= x2; i++)
{
if (a[z1] == b[i])
{
if(i!=x1)
head->left=find(z1-(x2-i)-1,x1,i-1);
if(i!=x2)
head->right=find(z1-1,i+1,x2);
}
}
return head;
}
void PreOrder(tree head)
{
if (head)
{
printf(" %d", head->data);
PreOrder(head->left);
PreOrder(head->right);
}
}
int main()
{
int n; scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++)
{
scanf("%d", &b[i]);
}
tree head = find(n - 1, 0, n - 1);
printf("Preorder:");
PreOrder(head);
return 0;
}