#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
#include <map>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <bitset>
#define f first
#define s second
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define pb push_back
#define vi vector <int>
#define ld long double
#define pii pair<int, int>
#define y1 sda
using namespace std;    
const int N = int(3e5), mod = int(1e9)  + 7; 

int n,q;
vi g[N];
bool used[N];
int cnt;

inline void dfs(int v){
	used[v] = 1;
	cnt++;
	for(int i = 0; i < g[v].size(); i++){
		int to = g[v][i];
		if(!used[to]) dfs(to);
	}
}

int main () {
	cin >> q;
	while(q--){
		cin >> n;
		if(n * (n - 1) / 2 <= 25){
			ll ans = 0;
			int sz = n * (n - 1) / 2;
			for(int mask = 0; mask < (1<<sz); mask++){
				if(__builtin_popcount(mask) < n - 1) continue;
				for(int i = 0; i < n; i++){
					g[i].clear();
					used[i] = 0;
				}
				int c = 0;
				cnt = 0;
				for(int i = 0; i < n; i++){
					for(int j = i + 1; j < n; j++){
						if(mask & (1<<c)){
							g[i].pb(j);
							g[j].pb(i);
						}
						c++;
					}
				}
				dfs(0);
				if(cnt == n) ans++;
			}
			cout << ans << endl;
		}
	}

return 0;
}