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<list>
#include<vector>
#include<stack>
#include<queue>
#include<algorithm>
#include<set>
#include<map>
using namespace std;

int main()
{
    set<int> a,b,d;
    int c;
    int n;
    cin>>n;
    while(n--){
        cin>>c;
        a.insert(c);
    }
    cin>>n;
    while(n--){
        cin>>c;
        b.insert(c);
    }
    set<int>::iterator it=d.begin();
    set<int>::iterator it1=a.begin(),it2=a.end(),it3=b.begin(),it4=b.end();
    //set_union(it1,it2,it3,it4,it);
    set_intersection(it1,it2,it3,it4,inserter(d,d.begin()));
    for(it=d.begin();it!=d.end();it++){
        cout<<*it<<"\n";
    }
}



