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

int N;
long double a[10005], mx = 0, sum = 0;
int tmp[10005];

int main(){
    cin >> N;
    for(int i = 0; i < N; i++) {
        cin >> a[i];
        mx = max(mx, a[i]);
    }
    for (int i = 1; i <= 10000; i++) {
        long double r = i / mx; 
        sum = 0;
        for (int j = 0; j < N; j++) {
            tmp[j] = round(a[j] * r);
            sum += tmp[j] * tmp[j];
        }

        for (int j = 0; j < N; j++) {
            if (tmp[j] == 0) break;
            if (fabs( (tmp[j] / sqrt(sum)) - a[j]) > 1e-6) break;
            if (j == N-1) {
                for (int k = 0; k < N; k++) {
                    cout << tmp[k] << endl;
                    //  cout << tmp[k] / sqrt(sum) << endl;
                }
                exit(0);
            }
        }
    }
}