1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22

#include <bits/stdc++.h>
using namespace std;

int A[5][20005];

int main {
    int N;
    cin >> N;
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < N; j++) cin >> A[i][j];
    }
    unordered_map<int, int> m[5];
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < N; j++) m[i][A[i][j]] = j;
    }
    sort(A[0], A[0] + N, [&m](const int& a, const int& b) {
        int c[2] = { 0 };
        for (int i = 0; i < 5; i++) c[m[i][a] < m[i][b]]++;
        return c[0] < c[1];
    });
    for (int i = 0; i < N; i++) cout << A[0][i] << '\n';    
}