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 <stdio.h>
#include <algorithm>
#include <vector>
#define MAX 200001

using namespace std;

int main()
{
	int n, m;
	int arr[MAX], brr[MAX];
	vector<int> vec(MAX);
	vector<int>::iterator itr = vec.begin();

	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]);
	}

	scanf("%d", &m);
	for (int j = 0; j < m; j++)
	{
		scanf("%d", &brr[j]);
	}

	itr = set_intersection(arr, arr + n, brr, brr + m, vec.begin());
	vec.resize(itr - vec.begin());

	for (unsigned loop = 0; loop < vec.size(); loop++)
	{
		printf("%d\n", vec[loop]);
	}

	return 0;
}