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 JAVA):

Solution:
//import java.lang.Math;
import java.util.*;
import java.util.Map.Entry;
//import java.util.ListIterator;
//import java.util.Iterator;
//import java.util.LinkedList;
 
public class Main{
	

	public static void main(String[] arg) {
               Scanner sc =new Scanner(System.in);
               TreeSet<Integer> ts= new TreeSet<Integer>();
               TreeSet<Integer> set1= new TreeSet<Integer>();
               int cnt=sc.nextInt();

               for(int i=0;i<cnt;i++){
            	  
                  set1.add(sc.nextInt());
                 }
               TreeSet<Integer> set2= new TreeSet<Integer>();
               int cnt2=sc.nextInt();

               for(int i=0;i<cnt2;i++){
                  set2.add(sc.nextInt());
                 }
                  
              ts.clear();
              ts.addAll(set1);
              ts.retainAll(set2);
             
               for(Iterator<Integer> it=ts.iterator();it.hasNext();){
               int xx=it.next();
               System.out.println(xx);
               }
	}
	}