#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;

ll gcd(ll a , ll b){
    if(a < b)swap(a , b);
    if(a % b == 0)return b;
    else return gcd(b , a % b);
}

int main(){
    int n;
    cin >> n;
    vector<ll> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    ll g = a[0];
    for(int i = 1; i < n; i++){
        g = gcd(a[i] , g);
    }
     for(int i = 0; i < n; i++){
        cout << a[i] / g;
        if(i != n - 1)cout << ":";
        else cout << endl;
    }
    return 0;
}