#include<bits/stdc++.h>
using namespace std;

using LD = double;

const int N = 1e4+5;
const LD eps = 5e-7;
int n, r[N], ans[N];
LD A[N], rt[N];

int gcd(int a, int b){return 0==b ? a : gcd(b, a%b);}

LD check(){
    int d = 0;
    for (int i=1; i<=n; ++i) d += r[i]*r[i];
    LD dt = sqrt(d);
    for (int i=1; i<=n; ++i) rt[i] = r[i]/dt;

    LD res = 0;

    for (int i=1; i<=n; ++i){
        res = max(abs(rt[i] - A[i]), res);
    }

    return res;
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    int mx=1;
    for (int i=1; i<=n; ++i){
        cin >> A[i];
        if (A[i] > A[mx]) mx=i;
    }

    LD minv = 1e30;
    for (int i=1; i<=10000; ++i){
        LD res = i / A[mx];
        for (int j=1; j<=n; ++j) r[j] = round(A[j]*res);
        LD rs = check();
        if(rs < minv) minv = rs, memcpy(ans, r, sizeof(int) * (n + 1));
    }

    // std::cerr << "Error = " << minv << char(10);

    int g = ans[1];
    for(int i=1; i<=n; ++i) g = __gcd(g, ans[i]);

    for (int i=1; i<=n; ++i){
        cout << ans[i] / g << '\n';
    }
    return 0;
}