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 <iterator>
#include <vector>
#include <algorithm>
#include <string>
#include <functional>
#include <set>

using namespace std;
void input(set<int> &);
void output(set<int> &);

int main()
{
    set<int> A, B;
    input(A);
    input(B);

    // set<int>::iterator it = B.begin();
    // while (it != B.end())
    // {
    //     if (A.find(*it) == A.end())
    //     {
    //         B.erase(*it);
    //     }
    //     it++;
    // }

    // output(B);


    // //法2
    set<int> C;
    set_intersection(A.begin(), A.end(), B.begin(), B.end(), inserter(C, C.begin()));
    output(C);
 
}


void input(set<int> & A)
{
    int n;
    cin >> n;

    int a;
    while (n--)
    {
        cin >> a;
        A.insert(a);
    }
}

void output(set<int> & A)
{
    set<int>::iterator it = A.begin();
    while (it != A.end())
    {
        cout << *it << endl;
        it++;
    }
}
