Prime Number Filter

You are given a list of integers. Your task is to filter and output all the prime numbers in the order they appear in the list.

A prime number is defined as an integer \( n \) greater than 1 that has no positive divisors other than 1 and itself. In mathematical notation, \( n \) is prime if \( n>1 \) and for every integer \( k \) with \( 2 \leq k \leq \sqrt{n} \), \( n \) is not divisible by \( k \).

If no prime numbers are found in the list, output an empty line.

inputFormat

The first line of the input contains a single integer N representing the total number of integers.

The second line contains N space-separated integers.

outputFormat

Output the prime numbers extracted from the list, separated by a single space. If there are no prime numbers, print an empty line.

6
2 3 5 7 11 13

2 3 5 7 11 13