#include <iostream>
#include <vector>
using namespace std;

long long gcd(long long a, long long b) {
	if (a == 0) return b;
	else return gcd(b % a, a);
}

int main(void) {
	int n;
	cin >> n;
	vector<long long> a(n);
	for (int i = 0; i < n; ++i) cin >> a[i];
	long long a_gcd = gcd(a[0], a[1]);
	for (int i = 1; i < n - 1; ++i) {
		a_gcd = gcd(a_gcd, a[i + 1]);
	}
	cout << a[0] / a_gcd;
	for (int i = 1; i < n; ++i) {
		cout << ':' << a[i] / a_gcd;
	}
	cout << endl;
	return 0;
}