#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=x,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}


void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<ll> p(N);
	rep(i,N) cin>>p[i];
	ll M=1e6+10;
	vector<vector<pair<int,int>>> table(M);
	rep(i,M){
		if(i<2) continue;
		if(table[i].size()==0){
			for(int j=i;j<M;j+=i){
				int D=j;
				while(D%i==0){
					D/=i;
					table[j].push_back({i,j/D});
				}
			}
		}
	}
	map<pair<int,int>,int> m;
	rep(i,N){
		for(auto x:table[p[i]]) m[x]++;
	}
	ll base=1;
	ll D=1;
	rep(i,N) base=(base*p[i])%mod;
	for(auto x:m){
		//cout<<x.first.first<<" "<<x.first.second<<" "<<x.second<<"\n";
		D=(D*x.first.first)%mod;
	}
	//cout<<D<<" "<<base<<"\n";
	rep(i,N){
		ll ans=(base*jyo(p[i],mod-2,mod))%mod;
		ll tmp=D;
		for(auto x:table[p[i]]){
			if(m[x]==1) tmp=(tmp*jyo(x.first,mod-2,mod))%mod;
		}
		//cout<<ans<<" ";
		cout<<(ans-tmp+mod)%mod<<"\n";
	}
}