1790

#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
    ifstream fin("input.txt");
    ofstream fout("output.txt");

    int n, m;
    fin >> n;
    vector<int> A(n);
    for (int i = 0; i < n; i++) fin >> A[i];
    fin >> m;
    vector<int> B(m);
    for (int i = 0; i < m; i++) fin >> B[i];
    vector<vector<int>> dp(n + 1, vector<int>(m + 1));
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) {
            if (A[i-1] == B[j-1])
                dp[i][j] = dp[i-1][j-1] + 1;
            else
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
        }

    int a = n; int b = m;
    vector<int> answ;
    while (a > 0 && b > 0) {
        if (A[a - 1] == B[b - 1]) {
            answ.push_back(A[a - 1]);
            a--; b--;
        }
        else if (dp[a][b] == dp[a][b - 1])
            b--;
        else
            a--;
    }
    for (int i = answ.size() - 1; i >= 0; i--) fout << answ[i] << " ";

    fin.close();
    fout.close();
    return 0;
}