#include<bits/stdc++.h>
#define LL long long
using namespace std;
int n,b[10010];
LL a[10010],mi,ma;
LL read(){
	char ch;
	LL res=0;
	scanf("%c%c",&ch,&ch);
	for (int i=0;i<12;i++){
		scanf("%c",&ch);
		res=res*10+ch-'0';
	}
	scanf("\n");
	return res;
}
int check(){
	int gc=b[0];
	LL sum=b[0]*b[0];
	for (int i=1;i<n;i++){
		gc=__gcd(b[i],gc);
		sum+=b[i]*b[i];
	}
	if (gc!=1) return 0;
	for (int i=0;i<n;i++)
	if ((fabs(b[i]/sqrt(sum)-1.0*a[i]/1000000000000LL))>1e-6) return 0;
	return 1;
}
int main(){
	//freopen("E.in","r",stdin);
	scanf("%d\n",&n);
	mi=1000000000000LL;
	for (int i=0;i<n;i++){
		a[i]=read();
		mi=min(a[i],mi);
		ma=max(a[i],ma);
	}
	for (int i=int(1.0*ma/mi);i<=10000;i++){
		for (int j=0;j<n;j++)
			b[j]=round(1.0*i*a[j]/ma);
		if (check()){
			for (int j=0;j<n;j++) printf("%d\n",b[j]);
			return 0;
		}
	}
}