1 #include <iostream>
 2 #include <vector>
 3 using namespace std;
 4
 5 bool convert(int preOrder[], int preBeg, int preEnd, int inOrder[], int inBeg, int inEnd, vector<int> &postOrder)
 6 {
 7     if (preEnd - preBeg != inEnd - inBeg)
 8         return false;
 9
10     if (preBeg > preEnd)
11         return true;
12
13     int root = preOrder[preBeg];
14     int index = -1;
15     for(int i = inBeg; i <= inEnd; i++)
16         if (inOrder[i] == root)
17         {
18             index = i;
19             break;
20         }
21
22     if (index == -1)
23         return false;
24
25     int len = index - inBeg;
26     bool left = convert(preOrder, preBeg + 1, preBeg + len, inOrder, inBeg, index - 1, postOrder);
27     bool right = convert(preOrder, preBeg + len + 1, preEnd, inOrder, index + 1, inEnd, postOrder);
28     postOrder.push_back(root);
29
30     return left && right;
31 }
32
33 int main()
34 {
35     int n;
36     int preOrder[1000];
37     int inOrder[1000];
38     while(cin >> n)
39     {
40         for(int i = 0; i < n; i++)
41             cin >> preOrder[i];
42         for(int i = 0; i < n; i++)
43             cin >> inOrder[i];
44
45         vector<int> postOrder;
46
47         bool res = convert(preOrder, 0, n - 1, inOrder, 0, n - 1, postOrder);
48
49         if (res)
50         {
51             for(int i = 0; i < postOrder.size(); i++)
52                     cout << postOrder[i] << ' ';
53             cout << endl;
54         }
55         else
56             cout << "No" << endl;
57     }
58 }