#include <iostream>
#include <numeric>
#include <vector>

template <class T>
T gcd(T n, T m) {
    while (m != 0) {
        n %= m;
        std::swap(n, m);
    }
    return n;
}

using lint = long long;

void solve() {
    int n;
    std::cin >> n;

    std::vector<lint> xs(n);
    for (auto& x : xs) std::cin >> x;

    auto g = std::accumulate(xs.begin(), xs.end(), 0LL,
                             [](lint acc, lint x) { return gcd(acc, x); });

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

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}