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

using namespace std;

int main (){
  int q,x;
  set<int> a,b;
  vector<int> result;

  cin >> q;

  for (int i = 0; i < q; i++){
    cin >> x;
    a.insert(x);
  }

  cin >> q;

  for (int i = 0; i < q; i++){
    cin >> x;
    b.insert(x);
  }
  set_intersection(begin(a),end(a),begin(b),end(b),inserter(result,end(result)));

  for_each(begin(result), end(result), [](int x) {
    cout << x << endl;
  });
  return 0;
}