"Prime" numbers#395
Given a set of distinct natural numbers, we say that a number is "prime for the given set" if it is not divisible by any other number in the set, except itself.
The first line contains an integer (1 \leq N \leq 100) — the number of elements in the set. The second line contains distinct integers from to , separated by spaces.
Output the numbers that are "prime for the given set," separated by a single space. The numbers must be printed in the order they appear in the input.
Example 1