// includes #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // macros #define ll long long int #define pb emplace_back #define mk make_pair #define pq priority_queue #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) using namespace std; // types typedef pair P; typedef pair Pl; typedef pair Pll; typedef pair Pd; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1e9 + 7; // solve template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template T gcd(T a, T b) { if(a > b)return gcd(b, a); if(a == 0)return b; return gcd(b % a, a); } int main(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector a(n); rep(i, n)cin >> a[i]; ll res = a[0]; for(int i = 1; i < n; i++)res = gcd(res, a[i]); for(int i = 0; i < n; i++)cout << a[i] / res << "\n:"[i+1!=n]; return 0; }