#include<bits/stdc++.h>

using namespace std;

typedef long double lf;
const int MX = 10'000;
const lf EPS = 1e-6;

int main()
{
	int n;
	scanf("%d", &n );

	vector< lf > x( n );
	for( auto &ref : x )
		scanf("%Lf", &ref );

	const lf mx = *max_element( x.begin(), x.end() );

	set< long long > cn;

	for( int r = 1; r <= MX; ++r )
	{
		const long long s2 = (long long) ( 1.0L * ( r * r ) / ( mx * mx ) + 0.5L );
		cn.insert( s2 - 2 );
		cn.insert( s2 - 1 );
		cn.insert( s2 );
		cn.insert( s2 + 1 );
		cn.insert( s2 + 2 );
	}

	for( auto &s2 : cn )
	{
		if( s2 <= 0 ) continue;

		const lf d = sqrtl( s2 );
		
		long long sum2 = 0, g = 0;
		vector< int > v;

		for( int i = 0; i < n; ++ i )
		{
			const long long ri = (long long) ( d * x[i] + 0.5L );
			if( 1 <= ri && ri <= MX && fabsl( ri / d - x[i] ) < EPS )
			{
				g = __gcd( g, ri );
				v.push_back( ri );
				sum2 += ri * ri;
			}
			else
			{
				g = -1;
				break;
			}
		}

		if( sum2 == s2 && g != -1 )
		{
			for( auto &rr : v )
				printf("%lld\n", rr / g );

			return 0;
		}
	}

	assert( false );

	return 0;
};