#include <bits/stdc++.h>

using i64 = long long;

template <typename T>
constexpr T power(T a, i64 b) {
    T c{1};
    while (b) {
        if (b % 2) {
            c *= a;
        }
        a *= a;
        b /= 2;
    }
    return c;
}

template <int P>
struct MInt {
    int x;
    constexpr MInt() : x{} {}
    constexpr MInt(i64 x_) : x{up(x_ % getMod())} {}

    static int Mod;
    constexpr static int getMod() {
        return P > 0 ? P : Mod;
    }
    constexpr static void setMod(int Mod_) {
        Mod = Mod_;
    }

    constexpr int up(int x) const {
        if (x < 0) {
            x += getMod();
        }
        return x;
    }
    constexpr int down(int x) const {
        if (x >= getMod()) {
            x -= getMod();
        }
        return x;
    }
    constexpr int norm(int x) const {
        return up(down(x));
    }

    constexpr int val() const {
        return x;
    }
    explicit constexpr operator int() const {
        return x;
    }
    constexpr MInt operator-() const {
        MInt res;
        res.x = norm(getMod() - x);
        return res;
    }
    constexpr MInt inv() const {
        assert(x != 0);
        return power(*this, getMod() - 2);
    }
    constexpr MInt &operator+=(MInt rhs) {
        x = down(x + rhs.x);
        return *this;
    }
    constexpr MInt &operator-=(MInt rhs) {
        x = up(x - rhs.x);
        return *this;
    }
    constexpr MInt &operator*=(MInt rhs) {
        x = 1ll * x * rhs.x % getMod();
        return *this;
    }
    constexpr MInt &operator/=(MInt rhs) {
        return *this *= rhs.inv();
    }
    friend constexpr MInt operator+(MInt lhs, MInt rhs) {
        return lhs += rhs;
    }
    friend constexpr MInt operator-(MInt lhs, MInt rhs) {
        return lhs -= rhs;
    }
    friend constexpr MInt operator*(MInt lhs, MInt rhs) {
        return lhs *= rhs;
    }
    friend constexpr MInt operator/(MInt lhs, MInt rhs) {
        return lhs /= rhs;
    }
    friend constexpr bool operator==(MInt lhs, MInt rhs) {
        return lhs.val() == rhs.val();
    }
    friend constexpr bool operator!=(MInt lhs, MInt rhs) {
        return lhs.val() != rhs.val();
    }
    friend constexpr std::istream &operator>>(std::istream &is, MInt &a) {
        i64 x = 0;
        is >> x;
        a = MInt(x);
        return is;
    }
    friend constexpr std::ostream &operator<<(std::ostream &os, const MInt &a) {
        return os << a.val();
    }
};

template <int P>
int MInt<P>::Mod = P;
template <>
int MInt<0>::Mod = 998244353;

template <int V, int P>
constexpr MInt<P> CInv = MInt<P>(V).inv();

constexpr int P = 1000000007;
using Z = MInt<P>;

constexpr int N = 31;

std::array<std::array<Z, N>, N> f, invf;

void solve() {
    int n;
    std::cin >> n;

    const int m = std::__lg(n) + 1;

    Z prod = 1;
    std::vector<Z> sz(m + 1), invsz(m + 1);
    sz[m] = invsz[m] = 1;
    for (int i = m, x = n; x > 1; --i, x /= 2) {
        int p = m - i + x % 2;
        sz[i - 1] = sz[i] + (1 << p);
        invsz[i - 1] = sz[i - 1].inv();
        prod *= f[p][0] * sz[i - 1];
    }
    Z invprod = prod.inv();

    std::vector<std::vector<Z>> invg(m, std::vector<Z>(m + 1));
    invg[0].assign(m + 1, 1);
    for (int i = 1; i < m; ++i) {
        for (int j = 1; j <= m - i; ++j) {
            invg[i][j] = invg[i - 1][j] * (sz[i] - (1 << j) + 1) * invsz[i];
        }
    }
    for (int i = 1; i < m; ++i) {
        invg[m - i][i] = invg[m - i][i].inv();
    }
    for (int i = m - 2; i >= 1; --i) {
        for (int j = 1; j <= m - i - 1; ++j) {
            invg[i][j] = invg[i + 1][j] * (sz[i + 1] - (1 << j) + 1) * invsz[i + 1];
        }
    }

    Z ans = 0;
    for (int i = m, x = n; x > 0; --i, x /= 2) {
        Z u = sz[i], v = 1;
        for (int j = 1; j < i; ++j) {
            u *= sz[j];
            v *= sz[j] - sz[i];
        }
        ans += u / v * invprod;
        if (x > 1) {
            int p = m - i + x % 2;
            for (int y = 1; y <= p; ++y) {
                Z coef = ((1 << y) - 1) * f[p][0] * invprod;
                coef *= invg[i - 1][y] * invf[p][y] * invf[y][0];
                ans += coef * (1 << (p - y));
            }
        }
    }

    std::cout << ans / n << "\n";
}

int main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);

    f[0][0] = 1;
    for (int i = 1; i < N; ++i) {
        f[i][i] = 1;
        for (int j = 0; j < i; ++j) {
            f[i][j] = f[i - 1][j] * f[i - 1][0] * ((1 << i) - (1 << j));
        }
    }
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j <= i; ++j) {
            invf[i][j] = f[i][j].inv();
        }
    }

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}