#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1'000'000'007;
using Mint = ModInt<MO>;


Int N;

int H;
Int as[110], bs[110], cs[110];
Int ps[110], qs[110], rs[110];

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%lld", &N);
    
    H = 0;
    bs[0] = N;
    for (; bs[H] > 1; ) {
      ++H;
      bs[H] = bs[H - 1] >> 1;
    }
    reverse(bs, bs + (H + 1));
    as[0] = 1;
    cs[0] = 1;
    for (int i = 1; i <= H; ++i) {
      as[i] = as[i - 1] << 1;
      cs[i] = cs[i - 1] << 1 | 1;
    }
    
    ps[H] = 1;
    qs[H] = 1;
    rs[H] = 0;
    for (int i = H; --i >= 0; ) {
      ps[i] = 1 + 2 * ps[i + 1];
      if (bs[i + 1] & 1) {
        qs[i] = 1 + ps[i + 1] + qs[i + 1];
      } else {
        qs[i] = 1 + qs[i + 1] + rs[i + 1];
      }
      rs[i] = 1 + 2 * rs[i + 1];
    }
/*
cerr<<"as = ";pv(as,as+H+1);
cerr<<"bs = ";pv(bs,bs+H+1);
cerr<<"cs = ";pv(cs,cs+H+1);
cerr<<"ps = ";pv(ps,ps+H+1);
cerr<<"qs = ";pv(qs,qs+H+1);
cerr<<"rs = ";pv(rs,rs+H+1);
*/
    
    Mint base = 1;
    for (int i = 0; i <= H; ++i) {
      base *= Mint(ps[i]).pow(bs[i] - as[i]);
      base *= Mint(qs[i]);
      if (i < H) {
        base *= Mint(rs[i]).pow(cs[i] - bs[i]);
      }
    }
// cerr<<"base = "<<base<<endl;
    
    auto get = [&](int i, Int u) -> Int {
      if (u < bs[i]) return ps[i];
      if (u == bs[i]) return qs[i];
      if (u > bs[i]) return rs[i];
      assert(false);
    };
    auto solve = [&](int i, Int u) -> Mint {
      Mint numer = 1, denom = base;
      const Int sz = get(i, u);
      Int v = u;
      for (int j = i; --j >= 0; ) {
        v >>= 1;
        const Int t = get(j, v);
        numer *= t;
        denom *= (t - sz);
      }
      numer *= sz;
// cerr<<"solve "<<i<<" "<<u<<": "<<numer<<"/"<<denom<<endl;
      return numer / denom;
    };
    
    Mint ans = 0;
    for (int i = 0; i <= H; ++i) {
      {
        Int bef = bs[i];
        for (int j = i; --j >= 0; ) {
          const Int u = bs[j] << (i - j);
          if (bef > u) {
            ans += Mint(bef - u) * solve(i, u);
          }
          bef = u;
        }
      }
      
      ans += solve(i, bs[i]);
      
      if (i < H) {
        Int bef = bs[i];
        for (int j = i; --j >= 0; ) {
          const Int u = ((bs[j] + 1) << (i - j)) - 1;
          if (bef < u) {
            ans += Mint(u - bef) * solve(i, u);
          }
          bef = u;
        }
      }
    }
    ans /= N;
    printf("%u\n", ans.x);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}