#include <iostream>
#include <cstdlib>
#include <cmath>
#include <vector>
long getgcd(long a, long b){
    while(0 < a and 0 < b){
        if(a < b)
            b = b % a;
        else
            a = a % b;
    }
    return std::max(a, b);
}

int main()
{
    long n;
    std::cin >> n;
    std::vector<long> t;
    for(long i = 0; i < n; i++){
        long a;
        std::cin >> a;
        t.push_back(a);
    }
    long gcd = t[0];
    for (long i = 1; i < n; i++){
        gcd = getgcd(gcd, t[i]);        
    }

    for (long i = 0; i < n; i++){
        if(0 < i) {std::cout << ":";}
        t[i] /= gcd;
        std::cout << t[i];
    }
    std::cout << std::endl;
}