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

#include<algorithm>
using namespace std;

#define INF ((int)(1e9))
#define MAX 110000


int main(){
	int n, m, temp;
	vector<int> ve;
	
	cin>>n;
	
	for(int i = 0; i < n; i++){
		cin>>temp;
		ve.push_back(temp);
	}
	cin>>m;
	
	for(int i = 0, j = 0; i < m; i++){
		cin>>temp;
		if(j >= n)continue;
		while(ve[j] < temp && j < n)j++;
		if(ve[j] == temp){
			cout<<temp<<endl;
			j++;
		}
	}
	return 0;
}
