#include"bits/stdc++.h"

using lint = int64_t;

constexpr int MOD = int(1e9) + 7;
constexpr int INF = 0x63636363;
constexpr int NINF = 0xcfcfcfcf;
constexpr lint LINF = 0x6363636363636363;

using namespace std;

using ld = long double;

typedef double d; // for N ~ 1e7; long double for N ~ 1e9
pair<lint, lint> approximate(d x, lint N) { /// start-hash
	lint LP = 0, LQ = 1, P = 1, Q = 0, inf = LLONG_MAX; d y = x;
	for (;;) {
		lint lim = min(P ? (N-LP) / P : inf, Q ? (N-LQ) / Q : inf),
		   a = (lint)floor(y), b = min(a, lim),
		   NP = b*P + LP, NQ = b*Q + LQ;
		if (a > b) {
			// If b > a/2, we have a semi-convergent that gives us a
			// better approximation; if b = a/2, we *may* have one.
			// Return {P, Q} here for a more canonical approximation.
			return (abs(x - (d)NP / (d)NQ) < abs(x - (d)P / (d)Q)) ? make_pair(NP, NQ) : make_pair(P, Q);
		}
		if (abs(y = 1/(y - (d)a)) > 3*N) {
			return {NP, NQ};
		}
		LP = P; P = NP;
		LQ = Q; Q = NQ;
	}
}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n; cin>>n;
    vector<ld> v(n);
    for(auto &x : v){
        cin>>x;
    }
    ld mini = v[0], maxi = v[0];
    for(auto &x : v){
        mini = min(mini, x);
        maxi = max(maxi, x);
    }  
    auto [p, q] = approximate(mini / maxi, 10000);
    //1 6
    vector<int> ans(n);
    for(int k = 1; p * k <= 10000; k++){
        int x = p * k;
        /*
            v[i] = x / d
            d = x / v[i]
        */
        ld D = ld(x) / mini;
        bool ok = true;
        ld real_d = 0;
        for(int i =0; i<n && ok; i++){
            /*
            v[i] = ans[i] / d
            ans[i] = v[i] * d
            */
            ans[i] = round(v[i] * D);
            if(ans[i] > 10000) ok = false;
            real_d += ans[i] * ans[i];
        }
        real_d = sqrt(real_d);
        for(int i =0; i<n && ok; i++){
            if(abs(v[i] - ld(ans[i]) / real_d) > 1e-6)
                ok = false;
        }

        if(ok){
            for(int x : ans)
                cout<<x<<"\n";
            return 0;
        }
    }


    return 0;
}