//#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//using i128 = __int128_t;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
constexpr char ln = '\n';
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}
inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}
inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}
inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
inline int kthbit(long long x, int k) {return (x>>k)&1;}
inline void print() {cout << "\n";}
template<class T>
inline void print(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";
    print();
}
template<class T, class... Args>
inline void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
inline void debug() {cerr << endl;}
template<class T>
inline void debug(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";
    debug();
}
template<class T, class... Args>
inline void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
#else
#define dump(x) void(0)
inline void debug() {}
template<class T> inline void debug(const vector<T> &v) {}
template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}
#endif
struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

template <uint_fast64_t Modulus> 
struct ModInt {
    using u64 = uint_fast64_t;

    u64 a;

    constexpr ModInt(const long long x = 0) noexcept : a(x >= 0 ? x % Modulus : (Modulus - (-x) % Modulus) % Modulus) {}
    constexpr u64 &value() noexcept {return a;}
    constexpr const u64 &value() const noexcept {return a;}
    constexpr ModInt operator+(const ModInt rhs) const noexcept {return ModInt(*this) += rhs;}
    constexpr ModInt operator-(const ModInt rhs) const noexcept {return ModInt(*this) -= rhs;}
    constexpr ModInt operator*(const ModInt rhs) const noexcept {return ModInt(*this) *= rhs;}
    constexpr ModInt operator/(const ModInt rhs) const noexcept {return ModInt(*this) /= rhs;}
    constexpr ModInt operator^(const long long rhs) const noexcept {return ModInt(*this) ^= rhs;}
    constexpr bool operator==(const ModInt &rhs) const noexcept {return a == rhs.a;}
    constexpr bool operator!=(const ModInt &rhs) const noexcept {return a != rhs.a;}
    constexpr ModInt &operator+=(const ModInt rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr ModInt &operator/=(ModInt rhs) noexcept {
        u64 exp = Modulus - 2;
        while (exp) {
            if (exp&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }
    constexpr ModInt &operator^=(long long exp) noexcept {
        ModInt rhs = a;
        a = 1;
        while (exp) {
            if (exp&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }

    friend ostream &operator<<(ostream& os, const ModInt& rhs) noexcept {return os << rhs.a;}
    friend istream &operator>>(istream& is, ModInt& rhs) noexcept {long long a; is >> a; rhs = a; return is;}
};

constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;

using mint = ModInt<MOD>;


template<typename T, int sz>
struct Matrix {
   	array<array<T, sz>, sz> A;
	int N;

   	Matrix() : N(sz) {}
   	Matrix(int N) : N(N) {}

	const array<T, sz> &operator[](int k) const {return A[k];}
  	array<T, sz> &operator[](int k) {return A[k];}

  	static Matrix I(int N) {
    	Matrix<T, sz> mat(N);
    	for(int i = 0; i < N; i++) mat[i][i] = 1;
    	return mat;
  	}

  	Matrix &operator+=(const Matrix &B) {
    	for(int i = 0; i < N; i++) {
      	    for(int j = 0; j < N; j++) {
        	    (*this)[i][j] += B[i][j];
            }
        }
    	return *this;
  	}

  	Matrix &operator-=(const Matrix &B) {
    	for(int i = 0; i < N; i++) {
      		for(int j = 0; j < N; j++) {
				(*this)[i][j] -= B[i][j];
			}
		}
    	return *this;
  	}

    Matrix &operator*=(const Matrix &B) {
        Matrix<T, sz> C(N);
        for(int i = 0; i < N; i++) {
            for(int k = 0; k < N; k++) {
                for(int j = 0; j < N; j++) {
                    C[i][j] += (*this)[i][k] * B[k][j];
                }
            }
        }
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                swap(A[i][j],C.A[i][j]);
            }
        }
        return *this;
    }

    Matrix &operator^=(long long k) {
        Matrix<T, sz> B = Matrix<T, sz>::I(N);
        while(k) {
            if(k & 1) B *= *this;
            *this *= *this;
            k >>= 1;
        }
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                swap(A[i][j],B.A[i][j]);
            }
        }
        return *this;
    }

    Matrix operator+(const Matrix &B) const {return (Matrix(*this) += B);}
    Matrix operator-(const Matrix &B) const {return (Matrix(*this) -= B);}
    Matrix operator*(const Matrix &B) const {return (Matrix(*this) *= B);}
    Matrix operator^(const long long k) const {return (Matrix(*this) ^= k);}
};

void solve() {
    int N; cin >> N;
    if (N < 5) {
        cout << 0 << ln;
        return;
    }
    N -= 5;
    //[0,16) p = 0, [16,32) p = 1;
    Matrix<mint, 32> mat;
    //odd->even not insert
    rep(i,16) mat[i][i+16] = 1;

    //even->odd insert
    rep(i,16) rep(j,i) mat[i+16][j] = 1;
    //even->odd not insert
    rep(i,16) mat[i+16][i] = 1;
    //odd->odd insert
    rep(i,16) {
        for (int j = 5; j < i; j++) mat[i+16][j+16] = 1;
    }
    mat ^= N;
    mint ans = 0;
    rep(i,16) ans += mat[i][0];
    for (int i = 5; i < 16; i++) ans += mat[i+16][0];
    cout << ans << ln;
}


int main() {
    int Q; cin >> Q;
    while (Q--) {
        solve();
    }
}


Measured memory_bytes: 3680