Primes in a Sequence

Problem Description

Given $n$ numbers, print all the primes among them in input order, separated by spaces.

(Terminology: a prime is a natural number greater than $1$ that is divisible only by $1$ and itself, for example $2$, $3$, $5$.)

Input Format

The first line contains an integer $n$, the number of values.
The second line contains $n$ integers, the sequence to be tested.

Output Format

Print all the primes among them in input order, separated by spaces. If there is no prime, print nothing.

Sample Input

5
2 3 4 5 6

Sample Output

2 3 5

Constraints

$1 \le n \le 1000$
$1 \le A_i \le 1000$