#include <bits/stdc++.h>
using namespace std;

#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
const int N = 2e6 + 10;
const int mod = 1e9 + 7;

int num = 0;
int n;
int vis[100];
void solve(int pos, int now) {
    if(pos <= 0) pos += n;
    if(pos > n) pos -= n;
    if(vis[pos]) return ;
    vis[pos]++;
    if(now == n) {
        num++;
        vis[pos] = 0;
        return ;
    }
    solve(pos + now, now + 1);
    solve(pos - now, now + 1);
    vis[pos] = 0;
}
int main() {
    int t;
    cin >> t;
    while(t--) {
        cin >> n;
        num = 0;
        solve(1, 1);
        cout << num << endl;
//        int ans = 1;
//        if(n > 1) ans = 2;
//        if(n > 2 && n % 2 == 0) ans = 4;
//        cout << ans << endl;
    }
}