1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5 #include <algorithm>
 6 using namespace std;
 7
 8 const int maxn = 1000 + 5;
 9 int a[maxn], b[maxn];
10 int p[maxn];
11 int vis[maxn];
12 int n;
13
14 void Output()
15 {
16     for (int i = 1; i <= n; i++) {
17         printf("%d%c", p[i], i != n ? ' ': '\n');
18     }
19 }
20
21
22 int main()
23 {
24     #ifndef ONLINE_JUDGE
25         freopen("in1.txt", "r", stdin);
26     #endif // ONLINE_JUDGE
27
28     while (scanf("%d", &n) !=EOF) {
29         for (int i = 1; i <= n; i++) {
30             scanf("%d", &a[i]);
31             p[i] = vis[i] = 0;
32         }
33
34         int cntzero = 0, pos = 0;
35         for (int i = 1; i <= n; i++) {
36             scanf("%d", &b[i]);
37             if (b[i] == a[i]) {
38                 p[i] = b[i];
39                 vis[b[i]] = 1;
40             }
41             else {   //b[i] != a[i]
42                 if (vis[b[i]] && !vis[a[i]]) {
43                     p[i] = a[i];
44                     vis[a[i]] = 1;
45                 }
46                 else if (!vis[b[i]] && vis[a[i]]) {
47                     p[i] = b[i];
48                     vis[b[i]] = 1;
49                 }
50                 cntzero++;
51                 pos = i;
52             }
53         }
54
55         if (cntzero == 1 && b[pos] != a[pos]) {
56             for (int j = 1; j <= n; j++) {
57                 if (!vis[j]) {
58                     p[pos] = j;
59                     break;
60                 }
61             }
62         }
63         // cntzero = 2
64         else {
65             for (int i = 1; i <= n; i++) {
66                 if (p[i] == 0) {
67                     if (!vis[a[i]] && vis[b[i]]) {
68                         p[i] = a[i];
69                         vis[p[i]] = 1;
70                     }
71                     // vis[a[i]] && !vis[b[i]] 或者 !vis[a[i]] && !vis[b[i]]
72                     else   {
73                         p[i] = b[i];
74                         vis[p[i]] = 1;
75                     }
76                 }
77             }
78         }
79         Output();
80     }
81     return 0;
82 }