#include #define rep(i, n) for (int i = 0; i < n; i++) using namespace std; using ll = long long; ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } int main() { int n; cin >> n; ll a[100]; rep(i, n) cin >> a[i]; ll g = a[n - 1]; rep(i, n - 1) g = gcd(g, a[i]); rep(i, n) { if (i) cout << ':'; cout << a[i] / g; } cout << endl; return 0; }