послед

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <string>
#include <string.h>

#define F first
#define S second



using namespace std;

int a[4010], b[4010], f[4010][4010];
vector <int> k;

int main()
{
    ios_base::sync_with_stdio(0);
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    int m;
    cin >> m;
    for (int i = 1; i <= m; i++)
        cin >> b[i];
    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= m; j++)
        f[i][j] = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        if (a[i] == b[j])
        f[i][j] = f[i - 1][j - 1] + 1;
    else
        f[i][j] = max(f[i - 1][j], f[i][j - 1]);
    //cout << f[n][m] << endl;
    int i = n;
    int j = m;
    /*for (int i = 0; i <= n; i++)
        {
            for (int j = 0; j <= m; j++)
                cout << f[i][j] << " ";
            cout << endl;
        }
    */
    while (f[i][j] != 0)
    {
        while (j > 1 && f[i][j] == f[i][j - 1])
            j--;
        if (a[i] == b[j])
        {
            k.push_back(a[i]);
            j--;
        }
        else
            if (i > 1)
            i--;
    }
   /* for (int i = 0; i < k.size(); i++)
        cout << k[i] << " ";
    cout << endl;
    */
    for (int i = k.size() - 1; i >= 0; i--)
    cout << k[i] << " ";
    return 0;
}