#include <iostream>
#include <vector>
using namespace std;
typedef long long LL;
//最大公約数
LL gcd(LL u, LL v) {
  LL r;
  while (0 != v) {
	  r = u % v; 
	  u = v; 
	  v = r; //
  }
  return u;
}
int main(int argc, char* argv[])
{
	int N;
	cin>>N;
	int i,j;
	vector<LL> A(N);
	LL Min=0;
	for (i=0;i<N;i++){
		cin>>A[i];
		if (Min<A[i]){
			Min=A[i];
		}
	}
	LL ys;
	for (i=0;i<N-1;i++){
		for (j=i+1;j<N;j++){
			ys=gcd(A[i],A[j]);
			if (Min>ys){
				Min=ys;
			}
		}
	}
	for (i=0;i<N;i++){
		cout<<A[i]/Min;
		if (i<N-1){
			cout<<":";
		}
	}
	cout<<endl;
	return 0;
}