#include <iostream>

#include <cstdio>

using namespace std;

struct Tree {

    Tree *lc, *rc;

    int data;

};

Tree *Create(int *preorder, int *inorder, int n) {

    for(int i = ; i < n; i++) {

        if(preorder[] == inorder[i]) {

            Tree *node = (Tree*)malloc(sizeof(Tree));

            node -> data = preorder[];

            node -> lc = Create(preorder+, inorder, i);

            node -> rc = Create(preorder+i+, inorder+i+, n-i-);

            return node;

        }

    }

    return NULL;

}

int rt;

void PostOrder(Tree *root) {

    if(root != NULL) {

        PostOrder(root -> lc);

        PostOrder(root -> rc);

        if(root -> data == rt)

            printf("%d\n", root->data);

        else

            printf("%d ", root->data);

    }

}

Tree *root;

int preorder[], inorder[]; 

int main() {

    int n;

    while(~scanf("%d", &n)) {

        for(int i = ; i < n; i++)

            scanf("%d", &preorder[i]);

        for(int i = ; i < n; i++)

            scanf("%d", &inorder[i]);

        root = NULL;

        rt = preorder[];

        root = Create(preorder, inorder, n);

        PostOrder(root);

    }

    return ;

}