import java.util.Scanner;

class Main {
    public static 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;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        long a[] = new long[N], tmp[] = new long[N];
        for (int i = 0; i < N; ++i) {
            a[i] = sc.nextLong();
            tmp[i] = a[i];
        }
        sc.close();
        for (int i = 1; i < N; ++i) tmp[i] = gcd(tmp[i - 1], tmp[i]);
        for (int i = 0; i < N; ++i) {
            System.out.print(a[i] / tmp[N - 1]);
            if (i != N - 1) System.out.print(":");
        }
    }
}