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 <algorithm>
#include <iostream>
#include <vector>

using vector = std::vector<int>;

int main(void) {
    int n;
    std::cin >> n;

    vector vec_a{};
    for (int i = 0; i < n; ++i) {
        int a;
        std::cin >> a;
        vec_a.push_back(a);
    }

    int m;
    std::cin >> m;

    vector vec_b{};
    for (int i = 0; i < m; ++i) {
        int b;
        std::cin >> b;
        vec_b.push_back(b);
    }

    vector intersection{};

    std::set_intersection(vec_a.begin(), vec_a.end(), vec_b.begin(),
                          vec_b.end(), std::back_inserter(intersection));

    for (auto iter = intersection.begin(); iter != intersection.end(); ++iter) {
        std::cout << *iter << std::endl;
    }
}
