#include<bits/stdc++.h>
#define rep(l,r) for(int i=l;i<=r;i++)
#define jrep(l,r) for(int j=l;j<=r;j++)

using namespace std;

typedef long double LD;
typedef long long ll;
const int N=1e4+10;

int n;
LD a[N];
int b[N],c[N];
LD p[N];

bool check(int x)
{
	rep(1,n)c[i]=round((double)b[i]/x);
	int d=c[1];
	rep(1,n)d=__gcd(d,c[i]);
	// if(x==1)cout<<d<<"\n";
	rep(1,n)c[i]/=d;
	rep(1,n)if(c[i]>10000)return false;
	LD q=0;
	rep(1,n)q+=(LD)c[i]*c[i];
	q=sqrt(q);
	rep(1,n)p[i]=c[i]/q;
	// if(x==1)rep(1,n)cout<<p[i]<<'\n';
	rep(1,n)if(fabsl(p[i]-a[i])>1e-6)return false;
	return true;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n;
	rep(1,n)cin>>a[i];
	rep(1,n)b[i]=round(sqrtl(a[i]*a[i]*1e16));
	// rep(1,n)cout<<b[i]<<"\n";
	rep(1,10000)if(check(i))
	{
		jrep(1,n)cout<<c[j]<<"\n";
		//jrep(1,n)cout<<p[j]<<"\n";
		return 0;
	}
	assert(false);
	return 0;
}
/*
2
0.707107
0.707107
*/