#include <bits/stdc++.h>
using namespace std;

typedef long double db;
const db eps=1e-7;
const db lim=10001;
int sign(db k){
	if (k<-eps) return -1;
	else if (k>eps) return 1;
	return 0;
}
long long div(db a,db b){
	long long tmp=a/b+0.5;
	return tmp;
}
db mod(db a,db b){
	return a-div(a,b)*b;
}

const int maxn=10000;
int n;
db a[maxn+50];
db b[maxn+50];

long long ans[maxn+50];
long long A[maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	mt19937 rng((unsigned long long)(new char));
//	cerr << fixed << setprecision(12);

	cin >> n;
	for (int i=1;i<=n;i++) cin >> a[i];
	
	/*
	{
		
		for (int i=1;i<=n;i++) A[i]=rng()%10000+1;
	//	for (int i=1;i<=n;i++) cin >> A[i];
	
		long long g=0;
		for (int i=1;i<=n;i++) g=__gcd(g,A[i]);
		for (int i=1;i<=n;i++) A[i]/=g;
		db D=1;
		for (int i=1;i<=n;i++) D+=A[i]*A[i];
		
		for (int i=1;i<=n;i++) cerr << A[i] << " ";
		cerr << endl;
		
		D=sqrtl(D);
		cerr << "D : " << D << endl;
		cerr << "1/D : " << 1/D << endl;
		for (int i=1;i<=n;i++) a[i]=((long long)(A[i]/D*1e12))/1e12;
		for (int i=1;i<=n;i++) cerr << a[i] << " ";
		cerr << endl;	
	}
	*/
	
	int mxpos=1;
	for (int i=1;i<=n;i++) if (a[i]>a[mxpos]) mxpos=i;
	
	for (int now=1;now<=10000;now++){
		for (int i=1;i<=n;i++) ans[i]=div(a[i]*now,a[mxpos]);
		db D=0;
		for (int i=1;i<=n;i++) D+=ans[i]*ans[i];
		D=sqrtl(D);
		bool flag=1;
		for (int i=1;i<=n;i++) if (sign(ans[i]/D-a[i])!=0) flag=0;
		if (flag) break;
	}
	for (int i=1;i<=n;i++) cout << ans[i] << "\n";
//	for (int i=1;i<=n;i++) assert(ans[i]==A[i]);
	return 0;
}