#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
int gcd(int a, int b)
{
	int c;
	while (a != 0) {
		c = a; a = b%a;  b = c;
	}
	return b;
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	vector<int> A(N);
	int res = 0; 
	int g = 0;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
		g = gcd(g, A[i]);
	}
	for (int i = 0; i < N; i++) {
		if (i > 0)cout << ":";
		cout << (A[i] / g);
	}
	cout << endl;
}