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<bits/stdc++.h>
using namespace std;
set<int> a, b;
int main()
{
	int n, m;
	scanf("%d",&n);
	int i;
	for(i=0; i<n; i++)
	{
		int x;
		scanf("%d",&x);
		a.insert(x);
	}
	scanf("%d",&m);
	for(i=0; i<m; i++) 
	{
		int x;
		scanf("%d",&x);
		b.insert(x);
	}
	vector<int> v;
	set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(v));
	for(i=0; i<v.size(); i++) printf("%d\n",v[i]);
	return 0;
}