//while(!GM)
//Practice++;
#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;
template <typename F> using o_set = tree<F, null_type, less<F>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename F> using o_multiset = tree<F, null_type, less_equal<F>, rb_tree_tag, tree_order_statistics_node_update>;
#define wlo '\n'
#define fast ios::sync_with_stdio(false); cin.tie(nullptr);
#define int long long
const int mod= 1e9+7;// 998244353;
using ll =long long ;

ll exp(ll x, ll n, ll m) {
  x %= m;
  ll res = 1;
  while (n > 0) {
    if (n % 2 == 1) { res = res * x % m;
     }
    x = x * x % m;
    n /= 2;
  }
  return res;
}
void dbrhawlo ()
{
    int n;
    cin>>n;
    int cnt = 1 ;
    for(int i =1;i<=2*n;i++)
    {
        cnt = (i*cnt)%mod;
    }
    int qwe = exp(2,mod-2,mod);// 2^(-1)
    cnt=(cnt*qwe)%mod;
    cout<<cnt<<wlo;

}
int32_t  main()
{
    fast;
    int t=1;
    cin>>t;
    while(t--)
    {
            dbrhawlo();
    }
    return 0;
}