#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
using namespace std;
#define lint long long int
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
*/

lint euc(lint a, lint b) {
	if (a < b) return euc(b, a);
	lint r;
	while ((r = a % b)) {
		a = b;
		b = r;
	}
	return b;
}

int main() {
	lint N;
	cin >> N;
	vector<lint>veca(N);
	for (lint i = 0; i < N; i++) {
		cin >> veca.at(i);
	}
	lint y = veca.at(0);
	for (int i = 0; i < N; i++) {
		y = euc(y, veca.at(i));
	}
	for (int i = 0; i < N; i++) {
		cout << veca.at(i) / y;
		if (i != N-1) {
			cout << ':';
		}
	}
	cout << endl;
}