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

#define MOD 998244353LL

using ll = long long;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;

    vector<ll> inv = {1, 1};
    vector<ll> fact = {1};
    vector<ll> invfact = {1};

    vector<ll> ans = {0};
    ll sum = 0;
    ll catalan = 0;

    while (T--)
    {
        int N;
        cin >> N;
        if (N % 2 == 1) cout << "0\n";
        else
        {
            N /= 2;
            while (fact.size() <= 2 * N)
            {
                ll x = fact.size();
                if (inv.size() == fact.size())
                {
                    inv.push_back((-(MOD / x) * inv[MOD % x]) % MOD + MOD);
                    inv[x] %= MOD;
                }
                fact.push_back(fact[fact.size() - 1] * x % MOD);
                invfact.push_back(invfact[invfact.size() - 1] * inv[x] % MOD);
            }
            
            while (ans.size() <= N)
            {
                ll next = 3LL * sum % MOD + catalan;
                
                next %= MOD;
                ans.push_back(next);
                sum += next;
                sum %= MOD;
                ll x = ans.size() - 1;
                ll c = fact[2 * x] * invfact[x] % MOD * invfact[x] % MOD * inv[x + 1] % MOD;
                
                catalan += c;
                catalan %= MOD;
            }

            cout << ans[N] << "\n";
        }
    }
}