#include <iostream>
#include <vector>

int main() {
    int n, m;
    std::cin >> n;
    std::vector<int> first(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> first[i];
    }
    std::cin >> m;
    std::vector<int> second(m);
    for (int i = 0; i < m; ++i) {
        std::cin >> second[i];
    }
    std::vector<std::vector<int> > data(n + 1, std::vector<int>(m + 1));
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            if (first[i - 1] == second[j - 1]) {
                data[i][j] = data[i - 1][j - 1] + 1;
            } else {
                data[i][j] = std::max(data[i - 1][j], data[i][j - 1]);
            }
        }
    }
    std::vector<int> results;
    int i = n, j = m;
    while (i > 0 && j > 0) {
        if (first[i - 1] == second[j - 1]) {
            results.push_back(first[i - 1]);
            --i;
            --j;
        } else if (data[i - 1][j] == data[i][j]) {
            --i;
        } else {
            --j;
        }
    }
    for (int i = 0; i < results.size(); ++i) {
        std::cout << results[results.size() - 1 - i] << ' ';
    }
    std::cout << '\n';
}