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

typedef long double db;
const db eps=1e-8;
const db lim=10001;
int sign(db k){
	if (k<-eps) return -1;
	else if (k>eps) return 1;
	return 0;
}
long long div(db a,db b){
	long long tmp=a/b+0.5;
	return tmp;
}
db mod(db a,db b){
	return a-div(a,b)*b;
}

const int maxn=10000;
int n;
db a[maxn+50];
db b[maxn+50];

long long ans[maxn+50];
long long A[maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	mt19937 rng((unsigned long long)(new char));
	cerr << fixed << setprecision(12);

	cin >> n;
	for (int i=1;i<=n;i++) cin >> a[i];
	/*
	{
		
		for (int i=1;i<=n;i++) A[i]=rng()%10000+1;
	//	for (int i=1;i<=n;i++) cin >> A[i];
	
		long long g=0;
		for (int i=1;i<=n;i++) g=__gcd(g,A[i]);
		for (int i=1;i<=n;i++) A[i]/=g;
		db D=1;
		for (int i=1;i<=n;i++) D+=A[i]*A[i];
		
		for (int i=1;i<=n;i++) cerr << A[i] << " ";
		cerr << endl;
		
		D=sqrtl(D);
		cerr << "D : " << D << endl;
		cerr << "1/D : " << 1/D << endl;
		for (int i=1;i<=n;i++) a[i]=((long long)(A[i]/D*1e12))/1e12;
		for (int i=1;i<=n;i++) cerr << a[i] << " ";
		cerr << endl;	
	}
	*/
	db g=0;
	for (int i=1;i<=n;i++) b[i]=a[i];
	for (int cnt=1;cnt<=100;cnt++){
		int mnpos=1;
		db mx=0;
		for (int i=1;i<=n;i++){
			if (sign(b[i])!=0){
				if (mnpos==0 || b[i]<b[mnpos]) mnpos=i;
			}
		}
		for (int i=1;i<=n;i++) mx=max(mx,b[i]);
		g=mx;
	//	cerr << "mn,mx : " << b[mnpos] << " " << mx << endl;
		if (sign(b[mnpos])==0) break;
		if (fabs(mx/b[mnpos])>lim) break;
		for (int i=1;i<=n;i++) if (i!=mnpos && sign(b[i])!=0) b[i]=fabs(mod(b[i],b[mnpos]));
		
	//	for (int i=1;i<=n;i++) cerr << b[i] << " ";
	//	cerr << endl;
	}
//	cerr << "g : " << g << endl;
	for (int i=1;i<=n;i++) ans[i]=div(a[i],g);
	for (int i=1;i<=n;i++) cout << ans[i] << "\n";
	return 0;	
}
/*
3
5984 3409 8792
*/