Problem:
Set Intersection

Find the intersection of two sets $A = \{a_0, a_1, ..., a_{n-1}\}$ and $B = \{b_0, b_1, ..., b_{m-1}\}$.

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.

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$

Sample Input 1

4
1 2 5 8
5
2 3 5 9 11

Sample Output 1

2
5

Solution in PHP (judge verdict: Accepted)

<?php
$numbers = fgets(STDIN);
$n = intval($numbers);
// print $n;

$numbers1 = preg_split("/[\s,]+/", rtrim(fgets(STDIN)));
// print_r($numbers);

$numbers2 = fgets(STDIN);
$n = intval($numbers);
// print $n;

$numbers2 = preg_split("/[\s,]+/", rtrim(fgets(STDIN)));
// print_r($numbers);
// print_r($numbers2);

$numbers_merge = array_intersect($numbers1, $numbers2);
sort($numbers_merge);

foreach ($numbers_merge as $nm){
    echo $nm;
    echo PHP_EOL;
}
// print_r($numbers_merge);