#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>

using namespace std;
int n;
double x[100005];
double m[100005];

int near(int i){
    for(int c=1; c<=10000; c++){
        double val = m[i] * c;

        if(fabs(val - round(val)) < 1e-9) return c;
    }
    return -1;
}


int gcd(int a, int b){
    if(a > b){
        int tmp = a;
        a = b;
        b = tmp;
    }
    while(b>0){
        int tmp = b;
        b = a%b;
        a = tmp;
    }
    return a;
}

int main(){
    
    cin>>n;
    for(int i=0; i<n; i++){
        cin>>x[i];
    }
    double mn=10000;
    int ind;
    for(int i=0; i<n; i++){
        if(x[i] < mn) {mn = x[i]; ind = i;}
    }

    for(int i=0; i<n; i++){
        m[i] = x[i]/x[ind];
    }
    

    int ans = 1;
    for(int i=0; i<n; i++){
        int mul = near(i);
        ans = (mul * ans)/gcd(mul, ans);
    }

    for(int i=0; i<n; i++){
        cout << static_cast<int>(round(m[i] * ans));
        if(i<n-1) cout<<' ';
    }
}