{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eA binary tree is a finite set of vertices that is either empty or consists of a root $r$ and two disjoint binary trees called the left and right subtrees. There are three most important ways in which the vertices of a binary tree can be systematically traversed or ordered. They are preorder, inorder and postorder. Let $T$ be a binary tree with root $r$ and subtrees $T_1$ and $T_2$.\u003cbr\u003e\u003cbr\u003eIn a preorder traversal of the vertices of $T$, we visit the root $r$ followed by visiting the vertices of $T_1$ in preorder, then the vertices of $T_2$ in preorder.\u003cbr\u003e\u003cbr\u003eIn an inorder traversal of the vertices of $T$, we visit the vertices of $T_1$ in inorder, then the root $r$, followed by the vertices of $T_2$ in inorder.\u003cbr\u003e\u003cbr\u003eIn a postorder traversal of the vertices of $T$, we visit the vertices of $T_1$ in postorder, then the vertices of $T_2$ in postorder, and finally we visit $r$.\u003cbr\u003e\u003cbr\u003eNow you are given the preorder sequence and inorder sequence of a certain binary tree. Try to find out its postorder sequence.\u003cbr\u003e\u003ccenter\u003e\u003cimg style\u003d\"max-width:100%;\" src\u003d\"CDN_BASE_URL/43f5e5ba858435faa9d9798d5af4fcac?v\u003d1702903873\"\u003e\u003c/center\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input contains several test cases. The first line of each test case contains a single integer $n$, such that $1\\leq n\\leq 1000$, and it denotes the number of vertices of the binary tree. It is followed by two lines, respectively indicating the preorder sequence and inorder sequence. You can assume they are always corresponding to an exclusive binary tree.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each test case print a single line specifying the corresponding postorder sequence.\u003cbr\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e9\n1 2 4 7 3 5 8 9 6\n4 7 2 1 8 5 9 3 6\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e7 4 2 8 9 5 6 3 1\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}