codeforces 582A GCD Table

A. GCD Table

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The GCD table G of size n × n for an array of positive integers a of length n is defined by formula

Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor of both xand y, it is denoted as . For example, for array a = {4, 3, 6, 2} of length 4 the GCD table will look as follows:

Given all the numbers of the GCD table G, restore array a.

Input

The first line contains number n (1 ≤ n ≤ 500) — the length of array a. The second line contains n2 space-separated numbers — the elements of the GCD table of G for array a.

All the numbers in the table are positive integers, not exceeding 109. Note that the elements are given in an arbitrary order. It is guaranteed that the set of the input data corresponds to some array a.

Output

In the single line print n positive integers — the elements of array a. If there are multiple possible solutions, you are allowed to print any of them.

Examples

input

4
2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2

output

4 3 6 2

input

1
42

output

42 

input

2
1 1 1 1

output

1 1 

题解：给你一个n*n的矩阵里面的是n个数互相gcd得出的结果，求出原来的数组

最大的数肯定是自己与自己gcd得出的结果，然后再去找最大的数，让已得到的结果与他gcd，将得出的数字减去2（因为表中的数字是对称的），然后再继续.......

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
int n;
const int maxn=500*500+7;
int num[maxn];
vector<int> vec;
map<int,int> ma;
ll gcd(ll a,ll b){
	return b==0?a:gcd(b,a%b);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n*n;i++){
		scanf("%d",&num[i]);
		ma[num[i]]++;
	}
	sort(num+1,num+n*n+1);
	for(int i=n*n;i>=1;i--){
		if(!ma[num[i]]) continue;
		else{
			ma[num[i]]--;
			for(int j=0;j<vec.size();j++){
				ma[gcd(vec[j],num[i])]-=2;
			}
			vec.push_back(num[i]);
		}
	}
	for(int i=0;i<vec.size();i++){
		cout<<vec[i]<<' ';
	}
}