Number Set#7331
You are given a set of positive integers. Find its largest subset such that every number in is a divisor of the product of all the other numbers in .
The first line contains single integer (3 \leq n \leq 10^4). The second line contains positive integers in strictly ascending order. None of these numbers exceeds 10^6.
The first line should give the size of the largest subset satisfying the condition. In the second line, you should list all the numbers in this subset in ascending order. If there is more than one subset satisfying the condition, output any one of them. You can assume that such a subset always exists and contains at least three elements.
Example 1