#include <bits/stdc++.h>
 
using namespace std;
#define fast ios::sync_with_stdio(false); cin.tie(nullptr);
#define ll long long
#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
 
const int oo = 1e9;
const ll INF = 1e18;
const ll MOD = 1e9+7;
const int N = 1e6;
 
long long binpow(long long a, long long b, long long m) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
        res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}
 
 
 
void solve(){
    int n ; cin >> n;
    ll dp[n+1];
    vector<int> freq(n+1), cnt(n+1);
    for(int i = 1; i <= n; i++){
        int x;
        cin >> x;
        freq[x]++;
    }
 
    for(int i = 1; i <= n; i++){
        for(int j = i; j <= n; j += i){
            cnt[i] = (cnt[i]%MOD + freq[j]%MOD)%MOD;
        }
    }
 
    for(int i = n; i >= 1; i--){
        dp[i] = (binpow(2, cnt[i], MOD) - 1 + MOD) % MOD;
        for(int j = 2*i; j <= n; j += i){
            dp[i] = (dp[i] - dp[j] + MOD) % MOD;
        }
    }
 
    for(int i = 1; i <= n; i++){
        cout << dp[i] << '\n';
    }
}
 
 
int main(){
 
    fast
 
    int t = 1; //cin >> t;
 
    while(t--) solve();
}
 
/*
 * at least and exact
 * 1 2 3 4 5 6 7 8 9 10
 * gcd = 10 -> 2^(10/10)-1 = 1 -> {10} 
 * gcd = 9 -> 2^(10/9)-1 = 1 -> {9}
 * gcd = 8 -> 2^(10/8)-1 = 1 -> {8}
 * gcd = 7 -> 2^(10/7)-1 = 1 -> {7}
 * gcd = 6 -> 2^(10/6)-1 = 1 -> {6}
 * gcd = 5 -> 2^(10/5)-1 - gcd(10) = 3-1 = 2 -> {5} {5 10}
 * gcd = 4 -> 2^(10/4)-1 - gcd(8) = 3-1 = 2 -> {4} {4 8}
 * gcd = 3 -> 2^(10/3)-1 - gcd(6) - gcd(9) = 7-1-1 = 5 -> {3} {3 6} {3 9} {6 9} {3 6 9}
 * gcd = 2 -> 2^(10/2)-1 - gcd(4) - gcd(6)-gcd(8) - gcd(10) = 31-2-1-1-1 = 26
 */

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwojZGVmaW5lIGZhc3QgaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOyBjaW4udGllKG51bGxwdHIpOwojZGVmaW5lIGxsIGxvbmcgbG9uZwojZGVmaW5lIGVuZGwgJ1xuJwojZGVmaW5lIGFsbCh2KSAodikuYmVnaW4oKSwgKHYpLmVuZCgpCiNkZWZpbmUgcmFsbCh2KSAodikucmJlZ2luKCksICh2KS5yZW5kKCkKCmNvbnN0IGludCBvbyA9IDFlOTsKY29uc3QgbGwgSU5GID0gMWUxODsKY29uc3QgbGwgTU9EID0gMWU5Kzc7CmNvbnN0IGludCBOID0gMWU2OwoKbG9uZyBsb25nIGJpbnBvdyhsb25nIGxvbmcgYSwgbG9uZyBsb25nIGIsIGxvbmcgbG9uZyBtKSB7CiAgICBhICU9IG07CiAgICBsb25nIGxvbmcgcmVzID0gMTsKICAgIHdoaWxlIChiID4gMCkgewogICAgICAgIGlmIChiICYgMSkKICAgICAgICByZXMgPSByZXMgKiBhICUgbTsKICAgICAgICBhID0gYSAqIGEgJSBtOwogICAgICAgIGIgPj49IDE7CiAgICB9CiAgICByZXR1cm4gcmVzOwp9CgoKCnZvaWQgc29sdmUoKXsKICAgIGludCBuIDsgY2luID4+IG47CiAgICBsbCBkcFtuKzFdOwogICAgdmVjdG9yPGludD4gZnJlcShuKzEpLCBjbnQobisxKTsKICAgIGZvcihpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKXsKICAgICAgICBpbnQgeDsKICAgICAgICBjaW4gPj4geDsKICAgICAgICBmcmVxW3hdKys7CiAgICB9CgogICAgZm9yKGludCBpID0gMTsgaSA8PSBuOyBpKyspewogICAgICAgIGZvcihpbnQgaiA9IGk7IGogPD0gbjsgaiArPSBpKXsKICAgICAgICAgICAgY250W2ldID0gKGNudFtpXSVNT0QgKyBmcmVxW2pdJU1PRCklTU9EOwogICAgICAgIH0KICAgIH0KCiAgICBmb3IoaW50IGkgPSBuOyBpID49IDE7IGktLSl7CiAgICAgICAgZHBbaV0gPSAoYmlucG93KDIsIGNudFtpXSwgTU9EKSAtIDEgKyBNT0QpICUgTU9EOwogICAgICAgIGZvcihpbnQgaiA9IDIqaTsgaiA8PSBuOyBqICs9IGkpewogICAgICAgICAgICBkcFtpXSA9IChkcFtpXSAtIGRwW2pdICsgTU9EKSAlIE1PRDsKICAgICAgICB9CiAgICB9CgogICAgZm9yKGludCBpID0gMTsgaSA8PSBuOyBpKyspewogICAgICAgIGNvdXQgPDwgZHBbaV0gPDwgJ1xuJzsKICAgIH0KfQoKCmludCBtYWluKCl7CiAgICAKICAgIGZhc3QKICAgIAogICAgaW50IHQgPSAxOyAvL2NpbiA+PiB0OwogICAgCiAgICB3aGlsZSh0LS0pIHNvbHZlKCk7Cn0KCi8qCiAqIGF0IGxlYXN0IGFuZCBleGFjdAogKiAxIDIgMyA0IDUgNiA3IDggOSAxMAogKiBnY2QgPSAxMCAtPiAyXigxMC8xMCktMSA9IDEgLT4gezEwfSAKICogZ2NkID0gOSAtPiAyXigxMC85KS0xID0gMSAtPiB7OX0KICogZ2NkID0gOCAtPiAyXigxMC84KS0xID0gMSAtPiB7OH0KICogZ2NkID0gNyAtPiAyXigxMC83KS0xID0gMSAtPiB7N30KICogZ2NkID0gNiAtPiAyXigxMC82KS0xID0gMSAtPiB7Nn0KICogZ2NkID0gNSAtPiAyXigxMC81KS0xIC0gZ2NkKDEwKSA9IDMtMSA9IDIgLT4gezV9IHs1IDEwfQogKiBnY2QgPSA0IC0+IDJeKDEwLzQpLTEgLSBnY2QoOCkgPSAzLTEgPSAyIC0+IHs0fSB7NCA4fQogKiBnY2QgPSAzIC0+IDJeKDEwLzMpLTEgLSBnY2QoNikgLSBnY2QoOSkgPSA3LTEtMSA9IDUgLT4gezN9IHszIDZ9IHszIDl9IHs2IDl9IHszIDYgOX0KICogZ2NkID0gMiAtPiAyXigxMC8yKS0xIC0gZ2NkKDQpIC0gZ2NkKDYpLWdjZCg4KSAtIGdjZCgxMCkgPSAzMS0yLTEtMS0xID0gMjYKICov