#include long gcd(long x, long y) { long r; if (y > x) { r = x; x = y; y = r; } while (y > 0) { r = x % y; x = y; y = r; } return x; } int main(void) { int N, i; long a[100], tmp[100]; scanf("%d", &N); for (i = 0; i < N; ++i) { scanf("%ld", &a[i]); tmp[i] = a[i]; } for (i = 1; i < N; ++i) tmp[i] = gcd(tmp[i - 1], tmp[i]); for (i = 0; i < N; ++i) { printf("%ld", a[i] / tmp[N - 1]); if (i != N - 1) printf(":"); } return 0; }