Find the intersection of two sets $A = \\{a_0, a_1, ..., a_{n-1}\\}$ and $B = \\{b_0, b_1, ..., b_{m-1}\\}$.

Constraints

* $1 \leq n, m \leq 200,000$
* $0 \leq a_0 < a_1 < ... < a_{n-1} \leq 10^9$
* $0 \leq b_0 < b_1 < ... < b_{m-1} \leq 10^9$

Input

The input is given in the following format.


$n$
$a_0 \; a_1 \; ... \; a_{n-1}$
$m$
$b_0 \; b_1 \; ... \; b_{m-1}$


Elements of $A$ and $B$ are given in ascending order respectively. There are no duplicate elements in each set.

Output

Print elements in the intersection in ascending order. Print an element in a line.

Example

Input

4
1 2 5 8
5
2 3 5 9 11


Output

2
5

#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <cmath>
#include <vector>
#include <queue>
#include <unordered_set>

typedef long long ll;
const ll LL_MAX (1LL<<60);

#define rep(i,s,e) for(ll i=(s); i<(e); i++) 

using namespace std;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n, tmp;
    cin >>n;
    unordered_set<ll> a;
    rep(i,0,n) cin >> tmp, a.insert(tmp); 
    ll m;
    unordered_set<ll> b;
    cin >>m;
    rep(i,0,m) cin >> tmp, b.insert(tmp); 

    vector<ll> ans;

    if (n>m)
    {
        for (auto i:a)
            if (b.find(i) != b.end()) ans.push_back(i);
    }
    else
    {
        for (auto i:b)
            if (a.find(i) != a.end()) ans.push_back(i);
    }

    sort(ans.begin(), ans.end());

    for(auto i: ans)
        cout << i << endl;

    return 0;
}

