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 namespace std;

template <typename T>
T set_oparate(T &sorted_a, T &sorted_b, char op) {
#define abc(a, b, c) begin(a), end(a), begin(b), end(b), inserter(c, end(c))
    T ret;
    switch (op) {
    case 'u':   // 和集合（A ∪ B）
        set_union(abc(sorted_a, sorted_b, ret)); break;
    case 'i':   // 積集合（A ∩ B）
        set_intersection(abc(sorted_a, sorted_b, ret)); break;
    case 'd':   // 差集合（A \ B, A ∩ B^c）
        set_difference(abc(sorted_a, sorted_b, ret)); break;
    case 's':   // 対称差（A Δ B, (A\B) ∪ (B\A)）
        set_symmetric_difference(abc(sorted_a, sorted_b, ret)); break;
    }
    return ret;
#undef abc
}

int main() {
    int n; cin >> n;
    vector<int> a(n);
    for (int &ai: a) cin >> ai;
    int m; cin >> m;
    vector<int> b(m);
    for (int &bi: b) cin >> bi;
    for (int x: set_oparate(a, b, 'i')) cout << x << endl;
    return 0;
}
