#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

const int prime_max = 1000000;
vector<int> prime;
int NP,divp[prime_max];
const ll mo=1000000007;

void cprime() {
	if(NP) return;
	for(int i=2;i<prime_max;i++) if(divp[i]==0) {
		//M[i]=NP;
		prime.push_back(i); NP++;
		for(ll j=1LL*i*i;j>=i&&j<prime_max;j+=i) if(divp[j]==0) divp[j]=i;
	}
}

ll modpow(ll a, ll n = mo-2) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}

int N,A[101010];
map<int,int> P[1010100];
vector<pair<int,int>> Ps[1010101];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	FOR(i,1000010) Ps[i].push_back({1,-1});
	cprime();
	cin>>N;
	ll prod=1;
	FOR(i,N) {
		cin>>A[i];
		x=A[i];
		FORR(c,prime) {
			if(c*c>x) break;
			if(x%c==0) {
				ll a=1;
				P[i][c]=1;
				while(x%c==0) P[i][c]*=c, x/=c;
				Ps[c].push_back({P[i][c],i});
			}
		}
		if(x>1) {
			P[i][x]=x;
			Ps[x].push_back({P[i][x],i});
		}
		prod=prod*A[i]%mo;
	}
	
	ll lcm=1;
	FOR(i,1000001) {
		sort(ALL(Ps[i]));
		lcm=lcm*Ps[i].back().first%mo;
	}
	FOR(i,N) {
		prod=prod*modpow(A[i])%mo;
		ll lcm2=lcm;
		FORR2(c,n,P[i]) {
			if(Ps[c].back().second==i) {
				lcm2=lcm2*modpow(n)%mo*Ps[c][Ps[c].size()-2].first%mo;
			}
		}
		cout<<(prod+mo-lcm2)%mo<<endl;
		prod=prod*A[i]%mo;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}