Mahima had a sequence of N integers. She generated all possible non-empty subsets of the array and found Greatest Common Divisor of elements in every subset. Thus, she formed a new sequence 2^N -1 integers. But unfortunately, she lost the original sequence.

For example, if she intially had the sequence {1,2,4} then the GCD of  7 subsets are {1,1,1,1,2,2,4}. 

You are given the new sequence of  2^N-1 integers in any random order.

Help her recover the original sequence.

Input Format

The first line contains a single integer  N.

Next line contains 2^N-1 integers where every integer is the gcd of a subset of the original sequence. 

Output format

Print the original sequence in non-decreasing order.

Input Constraints :

1<=N<=20

1<=A[i]<=10⁹

Probelm setter: Harshit Agarwala