#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

int gcd(int n, int m) {
    if (n < m) swap(n, m);
    while (m != 0) {
        int r = n % m;
        n = m;
        m = r;
    }
    return n;
}

int main() {
    int n;
    cin >> n;

    vector<ll> a(n);
    ll t = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        t = gcd(t, a[i]);
    }

    for (int i = 0; i < n; i++) {
        cout << a[i] / t << ":\n"[i == n - 1];
    }

    return 0;
}