#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <tuple>
#include <vector>
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int, bool> pib;
typedef tuple<int, int, bool> iib;
#define T make_tuple

const int P = 1e9 + 7;

int spes[40];
map<pib, map<int, ll> > f;
int n, D;

int dep(int x) {
    int d = 0;
    while (x)
        x /= 2, d++;
    return d;
}
ll fpow(ll a, ll b) {
    return b == 0 ? 1 : (b & 1 ? a * fpow(a * a % P, b / 2) % P : fpow(a * a % P, b / 2));
}
void dfs(int x, int spe, int d) {
    ll sizl, sizr;
    bool s = spe, sl = false, sr = false;
    if (f.count({x, s}))
        return;
    if (x == 1) {
        f[{x, s}][0] = 1;
        f[{x, s}][1] = 1 * fpow(n, P - 2);
        return;
    }
    if (x == 0) {
        f[{x, s}][0] = 1;
        return;
    }
    if (spe) {
        if (spes[d + 1] == (spe << 1)) {
            sizr = (1 << (D - dep(spe << 1 | 1))) - 1, sizl = x - 1 - sizr;
            dfs(sizl, spe << 1, d + 1);
            dfs(sizr, 0, d + 1);
            sl = true;
        } else {
            sizl = (1 << (D + 1 - dep(spe << 1))) - 1, sizr = x - 1 - sizl;
            dfs(sizl, 0, d + 1);
            dfs(sizr, spe << 1 | 1, d + 1);
            sr = true;
        }
    } else {
        dfs(x / 2, spe, d + 1);
        sizl = sizr = (x - 1) / 2;
    }
    f[{x, s}][0] = f[{sizl, sl}][0] * f[{sizr, sr}][0] % P * fpow(x, P - 2) % P;
    f[{x, s}][x] = f[{sizl, sl}][0] * f[{sizr, sr}][0] % P * fpow(n, P - 2) % P;
    for (auto p : f[{sizl, sl}]) {
        if (p.first == 0)
            continue;
        f[{x, s}][p.first] += p.second * f[{sizr, sr}][0] % P * fpow(x - p.first, P - 2) % P;
        f[{x, s}][p.first] %= P;
    }
    for (auto p : f[{sizr, sr}]) {
        if (p.first == 0)
            continue;
        f[{x, s}][p.first] += p.second * f[{sizl, sl}][0] % P * fpow(x - p.first, P - 2) % P;
        f[{x, s}][p.first] %= P;
    }

    // cout << x << "," << s << ": " << endl;
    // for (auto p : f[{x, s}]) {
    //     cout << p.first << " " << p.second << endl;
    // }
}
void solve() {
    cin >> n;
    f.clear();
    memset(spes, 0, sizeof(spes));
    D = dep(n);
    if ((n - 1) & n) {
        int t = n / 2, i = D - 1;
        while (t) {
            spes[i] = t;
            i--;
            t /= 2;
        }
    }
    bool s = spes[1] == 1;
    dfs(n, s, dep(1));

    ll ans = 0;
    for (auto p : f[{n, s}]) {
        if (p.first != 0)
            ans = (ans + p.second) % P;
    }
    cout << ans << endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--)
        solve();

    return 0;
}