Problem: 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

Solution (in CPP):

Solution:
#include <iostream>
#include <fstream>
#include <algorithm>
#include <set>
//#define LOCAL
#define be(n) n.begin(), n.end()
using namespace std;
typedef long long ll;
set<ll>a, b;


int main() {
#ifdef LOCAL
ifstream fin("1.txt");
streambuf*p;
p=cin.rdbuf(fin.rdbuf());
#endif // LOCAL
ll n;
cin>>n;
for(ll i=0;i<n;i++){
    ll v;
    cin>>v;
    a.insert(v);
}

ll m;
cin>>m;
for(ll i=0;i<m;i++){
    ll v;
    cin>>v;
    b.insert(v);
}
set<ll>c;
set_intersection(be(a), be(b), inserter(c, c.begin()));
for(set<ll>::iterator it=c.begin();it!=c.end();it++){
    cout<<*it<<endl;
}

#ifdef LOCAL
fin.close();
#endif // LOCAL
}