#include<iostream>
#include<vector>
using namespace std;
int main()
{
    vector <int> a,b;
    int na,nb,j,j1;cin>>na;
    for(int i=0;i<na;i++)
    {
        cin>>j;
        a.push_back(j);
    }
    cin>>nb;
    for(int i=0;i<nb;i++)
    {
        cin>>j1;
        b.push_back(j1);
    }
    for(int i=0;i<a.size();i++)
        for(int j=0;j<b.size();j++)
            if(a[i]==b[j])
                cout<<a[i]<<" ";
    return 0;
} 

#include <iostream>
using namespace std;
class SeqList
{
    int a[205], n;
public:
    SeqList()
    {

    }
    void init(int b[], int n)
    {
        this->n = n;
        for (int i = 0; i < n; i++)
        {
            a[i] = b[i];
        }
    }
    int Search(int x)
    {
        for (int i = 0; i < n; i++)
        {
            if (a[i] == x)
                return 1;
        }
        return -1;
    }
    int *Inter(SeqList Lb)
    {
        int *b = new int[n + Lb.n];
        int index = 0;
        for (int i = 0; i < n; i++)
        {
            if (Lb.Search(a[i]) == 1)
            {
                b[index] = a[i];
                index++;
            }
        }
        for (int i = 0; i < index; i++)
        {
            cout << b[i] << " ";
        }
        return b;
    }
    void print()
    {
        for (int i = 0; i < n; i++)
            cout << a[i] << " ";
    }
};
int main()
{
    int na; cin >> na;
    int b[205];
    for (int i = 0; i < na; i++)
    {
        cin >> b[i];
    }
    SeqList La;
    La.init(b, na);

    int nb; cin >> nb;
    int c[205];
    for (int i = 0; i < nb; i++)
    {
        cin >> c[i];
    }
    SeqList Lb;
    Lb.init(c, nb);
    int *d = new int[na + nb];
    d = La.Inter(Lb);
    return 0;
}