Remove Prime Numbers

You are given a list of integers. Your task is to remove all prime numbers from the list. An integer \( n \) is considered prime if \( n > 1 \) and it has no divisors other than 1 and itself. In formal terms, \( n \) is prime if and only if there does not exist an integer \( d \) such that \( 2 \le d \le \sqrt{n} \) and \( d \mid n \).

Example:

Input: 8
       2 3 5 10 15 21 23 27
Output: 10 15 21 27

If the list becomes empty after removing prime numbers, output an empty line.

inputFormat

The input is read from standard input (stdin) and consists of two lines:

• The first line contains a single integer \( n \) representing the number of elements in the list.
• The second line contains \( n \) space-separated integers.

outputFormat

Output the list after removing all prime numbers as space-separated integers on a single line. If there are no numbers to output, print an empty line.

## sample

8
2 3 5 10 15 21 23 27

10 15 21 27

</p>