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 <algorithm>

int min(int x, int y)
{
	return x>y ? y : x;
}

int main()
{	
	int n, m;
	std::cin >> n;
	int* A = new int[n];
	for (int i=0; i<n; i++) std::cin >> A[i];
	std::cin >> m;
	int* B = new int[m];
	for (int i=0; i<m; i++) std::cin >> B[i];
	
	int* C = new int[min(n,m)];
	for (int i=0; i<min(n,m); i++) C[i] = -1;
	std::set_intersection(A, A+n, B, B+m, C);
	
	for (int i=0; i<min(n,m); i++) {
		if (C[i] < 0) break;
		std::cout << C[i] << std::endl;
	}
	
	delete[] A;
	delete[] B;
	delete[] C;
	
	return 0;
}

