#include<bits/stdc++.h>
using std::cin;
using std::cout;
using u64 = unsigned long long;
const int mod = 998244353;
std::mt19937 gen(20040430);

using ll = long long;
using pr = std::pair<ll, ll>;
using db = long double;


pr frac(db x) {
	if(x < 1e-6)return pr(0, 1);
	if(x >= 1) {
		pr z = frac(x - (int)x);
		z.first += z.second * (int)x;
		return z;
	}
	pr z = frac(1 / x);
	std::swap(z.first, z.second);
	return z;
}
const int N = 10005;
db prod[N];
int main() {
#ifdef zqj
	freopen("$.in", "r", stdin);
#endif
	std::ios::sync_with_stdio(false), cin.tie(0);
	int n;
	cin >> n;
	std::vector<db> a(n);
	for(int i = 0;i < n;++i) {
		cin >> a[i];
		prod[i] = a[i] / a[0];
	}
	for(int i = 1;i <= 1e4;++i) {
		int ok = 1;
		for(int j = 0;j < n;++j) {
			db w = prod[j] * i;
			w -= round(w);
			if(fabs(w) > 1e-7) {
				ok = 0;
				break;
			}
		}
		if(ok) {
			for(int j = 0;j < n;++j) {
				cout << (int) round(prod[j] * i) << '\n';
			}
			return 0;
		}
	}
}