#include <bits/stdc++.h>
#define MP make_pair
#define F first
#define S second
typedef long long ll;
using namespace std;
typedef pair<int, int> pii;

const int LIMIT = 10000;

const double eps = 1e-9;

struct vecs {
	double d;
	int ans, idx;
} a[10000];

pii getVal(double a, double b) {
	for (int i = 1; i <= LIMIT; i++) {
		double x = b / (a / i);
		if (abs(x - round(x)) < eps) {
			return MP(i, round(x));
		}
	}
	return MP(-1, -1);
}

int lcm(int a, int b) {
	return ll(a) * b / __gcd(a, b);
}

int main() {
	int n, base = 1;
	pii rat[10000];
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i].d;
		a[i].idx = i;
	}
	sort(a, a + n, [](const vecs &x, const vecs &y){
			return x.d < y.d;
		});
	for (int i = 1; i < n; i++) {
		rat[i] = getVal(a[0].d, a[i].d);
		base = lcm(base, rat[i].F);
	}
	a[0].ans = base;
	for (int i = 1; i < n; i++) {
		a[i].ans = rat[i].S * base / rat[i].F;
	}
	sort(a, a + n, [](const vecs &x, const vecs &y){
			return x.idx < y.idx;
		});
	for (int i = 0; i < n; i++) {
		cout << a[i].ans << "\n";
	}
}