#include <stdio.h>
#include <stdlib.h>
#include <string.h>


struct node{
    int val;
    struct node* next;
    struct node* prev;
};

void inorder(struct node* root)     //  Inorder and postorder traversal is made by to check whether the tree is crt or not.
{
    if (root == NULL)
        return;
    inorder(root->prev);
    printf("%d ",&(root->val));
    inorder(root->next);
}

void poorder(struct node* root)
{
    if (root == NULL)
        return;
    poorder(root->prev);
    poorder(root->next);
    printf("%d ",&(root->val));
}

void pop(struct node* stack){
    stack=stack->prev;
    if(stack!=NULL) stack->next=NULL;
}

void push(struct node* stack, struct node* temp)
{
    struct node* Node=(struct node *)malloc(sizeof(struct node));

    if(stack==NULL){
        Node=temp;
        stack=Node;
    }else{
        Node=temp;
        stack->next=Node;
        Node->prev=stack;
        stack=Node;
    }
};




int main(){
    int n;
    scanf("%d",&n);
    int in[n],po[n];
    for(int i=0;i<n;i++){
        scanf("%d",&in[i]);
    }
    for(int i=0;i<n;i++){
        scanf("%d",&po[i]);
    }

    // initialized indexes
    int po_index=n-1,in_index=n-1,flag=0;
    // created stack, root and previous
    struct node* root=(struct node *)malloc(sizeof(struct node));
    struct node* stack=NULL;
    struct node* previ;
    root->val=(po[po_index]);
    root->next=NULL;
    root->prev=NULL;
    --po_index;
    push(stack,root);
    // intitalized prev
    previ=root;

    while(po_index>=0)
    {
        if(stack!=NULL && (in[in_index])==(stack->val)){
            previ=stack;
            pop(stack);
            --in_index;
            flag = 1;
            // no bug till now
        }else{
            // new node created
            struct node* temp=(struct node *)malloc(sizeof(struct node));
            // values assigned to the new node
            temp->val=(po[po_index]);
            temp->next=NULL;
            temp->prev=NULL;
            if(flag==0){
                previ->next = temp;
                previ = temp;
            }else{
                previ->prev= temp;
                previ = temp;
                flag=0;
            }
            push(stack,temp);
            --po_index;
        }
    }
    printf("%d",root->next->next->val);    // No error when I am printing the right part but if I print "root->left>val" it is giving me some garbage value.

// The rest of the code written below is to check whether the tree is crt or not.
    // inorder(root);
    // printf("\n");
    // poorder(root);
    // printf("\n");
    return 0;
}