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<set>
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
    int n; 
    cin >> n;
    set<int> s1,s2;
    for (int i = 0; i < n; i++) {int t; cin >> t; s1.insert(t);}
    cin >> n;
    for (int i = 0; i < n; i++) {int t; cin >> t; s2.insert(t);}
    set<int> s3;
    set_intersection(s1.begin(),s1.end(),s2.begin(), s2.end(), inserter(s3, s3.begin()));
    for (auto it = s3.begin(); it !=s3.end(); it++) {
        cout << *it << endl;
    }
    return 0;
}