#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>

int main() {

	//std::ifstream inf("Text.txt");	std::cin.rdbuf(inf.rdbuf());

	int N = 0;
	std::cin >> N;

	std::vector<long long int> a(N);
	for (int i = 0; i < N; i++) {
		std::cin >> a[i];
	}

	long long int min = *std::min_element(a.begin(), a.end());
	std::vector<long long int> b;
	for (int i = 1; i <= min / i; i++) {
		if (min % i == 0) {
			b.push_back(i);
			b.push_back(min / i);
		}
	}
	std::sort(b.rbegin(), b.rend());

	bool flg = false;
	for (unsigned int i = 0; i < b.size(); i++) {
		flg = true;
		for (int j = 0; j < N; j++) {
			if (a[j] % b[i] != 0) {
				flg = false;
				break;
			}
		}
		if (flg) {
			for (int k = 0; k < N; k++) {
				a[k] = a[k] / b[i];
			}
			break;
		}
	}

	for (int i = 0; i < N - 1; i++) {
		std::cout << a[i] << ":";
	}
	std::cout << a[N - 1] << std::endl;

	return 0;

}