#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

const static ll MOD = 1000000007LL;

ll mod_pow(ll x, ll n, ll mod){
  ll res = 1;
  while(n>0){
    if(n&1) res = res*x%mod;
    x = x*x%mod;
    n >>= 1;
  }
  return res;
}

ll extgcd(ll a, ll b, ll &x, ll &y){
  ll d = a;
  if(b!=0){
    d = extgcd(b,a%b,y,x);
    y -= (a/b)*x;
  }else{
    x = 1; y = 0;
  }
  return d;
}

ll mod_inverse(ll a, ll m){
  ll x, y;
  extgcd(a, m, x, y);
  return (m+x%m)%m;
}

ll fact[100005];
ll inv_sum[100005];
void init(){
  ll f = 1;
  ll isum = 0;
  REP(i,1,100005){
    ll res = mod_inverse(i, MOD);
    isum += res;
    isum %= MOD;
    inv_sum[i] = isum;

    f *= (ll)i;
    f %= MOD;
    fact[i] = f;
  }
}



ll solve1(ll N){
  return (N*N)%MOD;
}
ll solve2(ll N){
  ll ret = 0;
  ret += (((N*N)%MOD)*N)%MOD;
  ret %= MOD;
  ret += (N*N)%MOD;
  ret %= MOD;
  ret += MOD-N;
  ret %= MOD;
  return ret;
}
ll solve3(ll N){
  rep(i,100005){
    if(fact[i] > N) return i-1;
  }
  return 0;
}
ll solve4(ll N){
  return 4*N*N+17;
}
ll solve5(ll N){
  return mod_pow(N, N*N*N, MOD);
}
ll solve6(ll N){
  return N;
}
ll solve7(ll N){
  ll ret = N;
  ret *= fact[N];
  ret %= MOD;
  ret *= (inv_sum[N] + (MOD-1))%MOD;
  ret %= MOD;
  return ret;
}


int main(){
  init();
  int T;
  cin >> T;
  rep(t,T){
    int N;
    cin >> N;
    
    if(t>0){
      cout << endl;
    }
    cout << solve1(N) << endl;
    cout << solve2(N) << endl;
    cout << solve3(N) << endl;
    cout << solve4(N) << endl;
    cout << solve5(N) << endl;
    cout << solve6(N) << endl;
    cout << solve7(N) << endl;
  }
  
  return 0;
}