#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#define For(i, a, b) for(int i = (a); i < (b); i++)
#define Rep(i, n) For(i, 0, (n))
#define Rrep(i, n) for(int i = (n - 1); i >= 0; i--)
#define Itr(i, c) for(typeof(c.begin()) i = c.begin(); i != c.end(); i++)
#define pb push_back

const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MAX = 510000;
const int INF = 999999999;
const int MOD = 1000000007;

ll gcd(ll x, ll y){
	if(x < y){
		ll tmp = y;
		y = x;
		x = tmp;
	}
	ll r = x % y;
	while(r != 0){
		x = y;
		y = r;
		r = x % y;
	}
	return y;
}

int main(){
	ll n; cin >> n;
	ll d = 1, a[n];
	Rep(i, n){
		ll t; cin >> t; a[i] = t;
		if(i == 0){
			d = t;
		}else{
			d = gcd(d, t);
		}
	}
	Rep(i, n){
		cout << a[i] / d;
		if(i < n-1) cout << ":";
	}
	cout << endl;
	return 0;
}