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

using LD = long double;

const int N = 1e4+5;
int n, r[N];
LD A[N], rt[N];

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

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

    LD eps = 1e-6;
    for (int i=1; i<=n; ++i){
        if (abs(rt[i] - A[i]) >= eps) return false;
    }

    int g=r[1];
    for (int i=2; i<=n; ++i) g = gcd(g, r[i]);
    if (g>1) return false;
    return true;
}

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

    for (int i=1; i<=n; ++i){
        LD res = i / A[mn];
        for (int j=1; j<=n; ++j) r[j] = round(A[j]*res);
        if (check()) break;
    }

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