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 <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <functional>
#include <set>
#include <iterator>

#define INPUT_FROM_FILE (0) 
#if INPUT_FROM_FILE
#include <fstream>
#endif


int main(){
	int n, m, tmp;
	std::vector<int> a, b;
	std::vector<int> result;

#if INPUT_FROM_FILE
	std::ifstream ifs("test.txt");
#endif

#if INPUT_FROM_FILE
	ifs >> n;
#else
	std::cin >> n;
#endif
	
	for(int i = 0; i < n; i++){
#if INPUT_FROM_FILE
		ifs >> tmp;
#else
		std::cin >> tmp;
#endif
		a.push_back(tmp);
	}

#if INPUT_FROM_FILE
	ifs >> m;
#else
	std::cin >> m;
#endif
	
	
	for(int i = 0; i < m; i++){
#if INPUT_FROM_FILE
		ifs >> tmp;
#else
		std::cin >> tmp;
#endif
		b.push_back(tmp);
	}

	std::set_intersection(a.begin(), a.end(), b.begin(), b.end(), std::inserter(result, result.end()));

	for(int i = 0; i < result.size(); i++){
		std::cout << result[i] << std::endl;
	}
	return 0;
}
