#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll gcd(ll x, ll y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}

int main() {
  int N;
  scanf("%d", &N);
  vector<ll> a(N);
  for (int i = 0; i < N; ++i) scanf("%lld", &a[i]);

  ll g = a[0];
  for (int i = 1; i < N; ++i) g = gcd(g, a[i]);

  for (int i = 0; i < N; ++i) {
    cout << a[i] / g;
    if (i == N - 1) puts("");
    else cout << ":";
  }
  return 0;
}