#include <stdio.h>

#include <stdlib.h>

typedef struct Node {

    int Data;

    struct Node *Left,*Right;

}Node;

int q[],z[];///q记录前序遍历 z记录中序遍历

Node* creatNode() {

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

    if(node == NULL) exit();

    node -> Left = node -> Right = NULL;

    return node;

}

Node* rTree(int q1,int q2,int z1,int z2) {

    Node *node = creatNode();

    node -> Data = q[q1];

    for(int i = z1;i <= z2;i ++) {

        if(z[i] == q[q1]) {

            if(i != z1) node -> Left = rTree(q1 + ,q1 + i - z1,z1,i - );

            if(i != z2) node -> Right = rTree(q1 + i - z1 + ,q2,i + ,z2);//右儿子构建

            break;

        }

    }

    return node;

}

//void postOrder(Node *node) {

//    if(node == NULL) return;

//    postOrder(node -> Left);

//    postOrder(node -> Right);

//    printf("%d ",node -> Data);

//}

//void postOrder(Node *node) {///下标标记

//    Node *s[100];

//    char num[100] = {0};

//    int c = 0;

//    s[c ++] = node;

//    while(c) {

//        Node *temp = s[c - 1];

//        if(num[c - 1]) {

//            num[c - 1] = 0;

//            printf("%d ",s[-- c] -> Data);

//        }

//        else {

//            num[c - 1] = 1;

//            if(temp -> Right) {

//                s[c ++] = temp -> Right;

//            }

//            if(temp -> Left) {

//                s[c ++] = temp -> Left;

//            }

//        }

//    }

//}

void postOrder(Node *node) {///前驱结点判断

    Node *s[],*la;

    int c = ;

    s[c ++] = node;

    while(c) {

        Node *temp = s[c - ];

        if(temp -> Left == temp -> Right && temp -> Left == NULL || la == temp -> Left || la == temp -> Right) {

            printf("%d ",s[-- c] -> Data);

            la = temp;

        }

        else {

            if(temp -> Right && la != temp -> Right) {

                s[c ++] = temp -> Right;

            }

            if(temp -> Left && la != temp -> Left) {

                s[c ++] = temp -> Left;

            }

        }

    }

}

int main() {

    int n;

    Node *tree;

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

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

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

        }

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

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

        }

        tree = rTree(,n - ,,n - );

        postOrder(tree);

        putchar('\n');

    }

    return ;

}