#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001


int main(){
	
	vector<int> isp(1000001,-1);
	vector<int> p;
	for(int i=2;i<isp.size();i++){
		if(isp[i]==-1){
			p.push_back(i);
			for(int j=i;j<isp.size();j+=i)isp[j] = i;
		}
	}
	int N;
	cin>>N;
	vector<int> A(N);
	mint sum = 1;
	vector<int> cnt(1000001,0);
	rep(i,N){
		scanf("%d",&A[i]);
		cnt[A[i]]++;
		sum *= A[i];
	}
	vector<int> cnt2(1000001,0);
	rep(i,p.size()){
		long long cur = p[i];
		while(cur <= 1000000){
			
			for(int j=cur;j<=1000000;j+=cur){
				cnt2[cur] += cnt[j];
			}
			if(cnt2[cur]>=2){
				sum /= mint(p[i]).pow(cnt2[cur]-1);
			}
			cur *= p[i];
		}
	}
	vector<mint> ans(N,0);
	//cout<<sum.val()<<endl;
	rep(i,N){
		mint temp = sum / A[i];
		map<int,int> mp;
		int t = A[i];
		while(t!=1){
			mp[isp[t]]++;
			t/=isp[t];
		}
		for(auto a:mp){
			int x = 1;
			rep(j,a.second){
				x *= a.first;
				if(cnt2[x]>=2){
					temp *= a.first;
				}
			}
		}
		ans[i] = temp;
	}
	
	sum = 1;
	rep(i,N){
		sum *= A[i];
	}
	
	rep(i,N){
		ans[i] = sum / A[i] - ans[i];
	}
	
	rep(i,N){
		cout<<ans[i].val()<<endl;
	}
	
	
		
    return 0;
}