#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
using namespace std;

const int N = 1e4, inf = 1e9;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const double eps = 1e-6;

void solve(){
    int n;
    cin >> n;
    vector<double> x(n);
    for(int i = 0; i < n; i++){
        cin >> x[i];
    }
    for(int a0 = 1; a0 <= N; a0++){
        vector<int> ans(n, 0);
        ans[0] = a0;
        for(int i = 1; i < n; i++){
            ans[i] = round(static_cast<double>(ans[0]) * (x[i] / x[0]));
        }
        double d = 0;
        for(int i = 0; i < n; i++){
            d += ans[i] * ans[i];
        }
        d = sqrt(d);
        bool ok = true;
        for(int i = 0; i < n; i++){
            ok &= abs(x[i] - static_cast<double>(ans[i]) / d) <= eps;
        }
        if(ok){
            for(int i = 0; i < n; i++){
                cout << ans[i] << ' ';
            }
            cout << '\n';
            break;
        }
    }
}

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