#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long gcd(long m, long n){
  if(m < n){
    swap(m, n);

  }
  if(m % n == 0){
    return n;

  }
  return gcd(n, m % n);

}

long gcd(long A, vector<long> a, int i, int N){
  if(i == N - 1){
    return gcd(A, a[i]);

  }
  return gcd(gcd(A, a[i]), a, i + 1, N);
  
}

int main(void){
  int N;
  cin >> N;
  vector<long> a(N);
  for(int i = 0; i < N; i++){
    cin >> a[i];

  }
  long g = gcd(a[0], a, 1, N);  
  for(int i = 0; i < N; i++){
    if(i != 0){
      cout << ':';

    }
    cout << a[i]/g;

  }
  cout << endl;
  return 0;
}