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

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}


template<typename T, T MOD = 1000000007>
struct Mint{
  static constexpr T mod = MOD;
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }

  static Mint add_identity(){return Mint(0);}
  static Mint mul_identity(){return Mint(1);}

  Mint inv(){return pow(MOD-2);}

  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}

  Mint operator+(Mint a) const{return Mint(v)+=a;}
  Mint operator-(Mint a) const{return Mint(v)-=a;}
  Mint operator*(Mint a) const{return Mint(v)*=a;}
  Mint operator/(Mint a) const{return Mint(v)/=a;}

  Mint operator-() const{return v?Mint(MOD-v):Mint(v);}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
  bool operator <(const Mint a)const{return v <a.v;}

  static Mint comb(long long n,int k){
    Mint num(1),dom(1);
    for(int i=0;i<k;i++){
      num*=Mint(n-i);
      dom*=Mint(i+1);
    }
    return num/dom;
  }
};
template<typename T, T MOD> constexpr T Mint<T, MOD>::mod;
template<typename T, T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int n;
  cin>>n;
  auto as=read(n);

  const int MAX = 1e6+10;
  vector<vector<int>> G(MAX);
  for(int i=2;i<MAX;i++){
    if(G[i].size()>0) continue;
    for(int j=i;j<MAX;j+=i)
      G[j].emplace_back(i);
  }

  using M = Mint<int>;
  M all{1};
  for(int a:as) all*=M(a);

  vector<vector<int>> E(MAX);
  for(int a:as){
    for(int p:G[a]){
      int t=a,k=0;
      while(t%p==0) t/=p,k++;
      E[p].emplace_back(k);
    }
  }

  M den{1};
  for(int i=2;i<MAX;i++){
    if(E[i].empty()) continue;
    sort(E[i].rbegin(),E[i].rend());
    E[i].emplace_back(0);
    den*=M(i).pow(E[i][0]);
  }

  for(int a:as){
    M res(den);
    for(int p:G[a]){
      int t=a,k=0;
      while(t%p==0) t/=p,k++;
      // cout<<a<<':'<<t<<' '<<p<<endl;
      if(E[p][0]==k){
        res/=M(p).pow(E[p][0]);
        res*=M(p).pow(E[p][1]);
      }
    }
    cout<<all/M(a)-res<<newl;
  }
  return 0;
}