// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int64 power_mod(int64 a, int64 n, int p = MOD) {
  int64 ret = 1;
  for (; n; n >>= 1) {
    if (n & 1) ret = ret * a % p;
    a = a * a % p;
  }
  return ret;
}

namespace linear_seq {
// a * a % p
void sqr(vector<int>& a, const vector<int>& p) {
  int n = a.size();
  vector<int> ret(n << 1);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      ret[i + j] = (ret[i + j] + 1LL * a[i] * a[j]) % MOD;
    }
  }
  for (int i = n * 2 - 1; i >= n; --i) {
    if (!ret[i]) continue;
    for (int j = 0; j < n; ++j) {
      int k = i - n + j;
      ret[k] = (ret[k] - 1LL * ret[i] * p[j]) % MOD;
    }
  }
  for (int i = 0; i < n; ++i) a[i] = ret[i];
}

// a[n] = sum_k c[k]*a[n-1-k]
int get(int64 n, const vector<int>& c, const vector<int>& a) {
  int m = c.size();
  vector<int> p(m + 1);
  for (int i = 0; i < m; ++i) p[m - 1 - i] = -c[i]; p[m] = 1;
  vector<int> r(m); r[0] = 1;
  int len = 0;
  while ((1LL << len) <= n) ++len;
  for (int k = len - 1; k >= 0; --k) {
    sqr(r, p);
    if ((n >> k) & 1) {
      int carry = r[m - 1];
      for (int i = m - 2; i >= 0; --i) r[i + 1] = r[i]; r[0] = 0;
      for (int i = 0; i < m; ++i) r[i] = (r[i] - 1LL * carry * p[i]) % MOD;
    }
  }
  int ret = 0;
  for (int i = 0; i < m; ++i) ret = (ret + 1LL * r[i] * a[i]) % MOD;
  if (ret < 0) ret += MOD;
  return ret;
}

vector<int> BM(const vector<int>& a) {
  vector<int> C(1, 1), B(1, 1);
  int L = 0, m = 1, b = 1;
  for (int n = 0; n < (int)a.size(); ++n) {
    int64 d = 0;
    for (int i = 0; i <= L; ++i) d = (d + 1LL * C[i] * a[n - i]) % MOD;
    if (d == 0) {
      ++m;
    } else {
      auto T = C;
      int64 c = MOD - d * power_mod(b, MOD - 2) % MOD;
      while (C.size() < B.size() + m) C.push_back(0);
      for (int i = 0; i < (int)B.size(); ++i) C[i + m] = (C[i + m] + c * B[i]) % MOD;
      if (2 * L <= n) {
        L = n + 1 - L; B = T; b = d; m = 1;
      } else {
        ++m;
      }
    }
  }
  return C;
}

int solve(const vector<int>& a, int64 n) {
  vector<int> c = BM(a);
  trace(c.size(), c);
  c.erase(c.begin());
  for (auto& x : c) x = (MOD - x) % MOD;
  return get(n, c, a);
}
}

const int N = 100;
int F[N], G[N];

int64 comb(int n, int m) {
  if (n < m || m < 0) return 0;
  return (int64)F[n] * G[m] % MOD * G[n - m] % MOD;
}

void init(int n) {
  static int inv[N];
  inv[1] = 1;
  for (int i = 2; i < n; ++i) {
    inv[i] = (MOD - MOD / i) * (int64)inv[MOD % i] % MOD;
  }
  F[0] = G[0] = 1;
  for (int i = 1; i < n; ++i) {
    F[i] = (int64)F[i - 1] * i % MOD;
    G[i] = (int64)G[i - 1] * inv[i] % MOD;
  }
}

int64 comb2(int n, int m) {
  int64 ret = 1;
  for (int i = 0; i < m; ++i) ret = ret * (n - i) % MOD;
  ret = ret * G[m] % MOD;
  return ret;
}

int main() {
  init(N);
  int cas;
  vector<int> a(50);
  for (int k = 5; k < 100; ++k) {
    int n = k - 5;
    int ret = 0;
    for (int i = 0; i <= 11 && i <= n; ++i) {
      if ((n - i) % 2) continue;
      int k = (n - i) / 2;
      // trace(i, k, comb2(k + 15, 15));
      ret = (ret + comb(11, i) * comb2(k + 15, 15) % MOD) % MOD;
    }
    a[k] = ret;
  }
//   return 0;
// }

// int main() {
//   vector<int> a = {1, 1, 2, 3, 5, 8, 13, 21};
  // for (int n = 0; n < 30; ++n) {
  scanf("%d", &cas);
  while (cas--) {
    int n;
    scanf("%d", &n);
    int ret = linear_seq::solve(a, n);
    printf("%d\n", ret);
  }
  // }
  return 0;
}


Measured memory_bytes: 3228