#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ; 
typedef vector<int> vi;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1e4 + 7 ;
const long double eps = 1e-8 ;

int n ;
long double a[ MAXN ] ;
ll rem[ MAXN ] ;

const int lim = 1e4 ;

void solve ( ) {
    cin >> n ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> a[ i ] ;
    }
    for ( int i = 1 ; i <= lim ; ++ i ) {
        long double d = i / a[ 1 ] ;
        bool bad = false ;
        ll tot = i ;
        long double sm = i * i ;
        rem[ 1 ] = i ;
        for ( int j = 2 ; j <= n ; ++ j ) {
            long double aux = a[ j ] * d ;
            rem[ j ] = round ( aux ) ;
            /**
            if ( aux - hh > eps || aux - hh < -eps ) {
                bad = true ;
                break ;
            }
            **/
            if ( rem[ j ] < 1 || rem[ j ] > lim ) {
                bad = true ;
                break ;
            }
            sm += rem[ j ] * rem[ j ] ;
            tot = __gcd ( tot , rem[ j ] ) ;
        }
        if ( tot != 1 ) { bad = true ; }
        long double act = sqrt ( sm ) ;
        if ( bad == true ) { continue ; }
        for ( int j = 1 ; j <= n ; ++ j ) {
            long double aux = a[ j ] * act ;
            if ( aux - rem[ j ] > eps || aux - rem[ j ] < -eps ) {
                bad = true ;
                break ;
            }
        }
        if ( bad == false ) {
            for ( int j = 1 ; j <= n ; ++ j ) {
                cout << rem[ j ] << "\n" ;
            }
            return ;
        }
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}