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

#define ll long long

const ll MAX_N = 10000000, mod = 998244353;
ll dp1[MAX_N + 10], dp2[MAX_N + 10];
ll c2[MAX_N + 10], c3[MAX_N + 10], c4[MAX_N + 10], c5[MAX_N + 10], c6[MAX_N + 10], c7[MAX_N + 10];

ll pow2[MAX_N + 10]; //2^N
ll fact[MAX_N + 10]; //N!

void solve(){
    pow2[0] = 1;
    fact[0] = 1;
    for(ll N = 1; N <= MAX_N; N++) {
        // 2^N
        pow2[N] = 2 * pow2[N - 1] % mod;

        // N!
        fact[N] = N * fact[N - 1] % mod;

        // dp1
        if(N == 1) dp1[N] = 2;
        else if(N == 2) dp1[N] = 6;
        else dp1[N] = 2 * (dp1[N - 1] + (N - 1) * dp1[N - 2] % mod) % mod;

        // dp2
        if(N == 1) dp2[N] = 1;
        else if(N == 2) dp2[N] = 2;
        else dp2[N] = (dp2[N - 1] + (N - 1) * dp2[N - 2] % mod) % mod;

        // c2
        if(N == 1) c2[N] = 1;
        else if(N == 4) c2[N] = 2;
        else if(N % 4 == 0) c2[N] = (N - 2) * c2[N - 4] % mod;
        else if(N % 4 == 1) c2[N] = (N - 3) * c2[N - 4] % mod;
        else c2[N] = 0;

        // c3
        c3[N] = dp1[N / 2];

        // c4
        c4[N] = (pow2[N / 2] * fact[N / 2] % mod - c2[N] - c3[N] + mod * 2) % mod;

        // c5 = c6
        c5[N] = c6[N] = (dp2[N] - c3[N] + mod) % mod;

        //c7
        c7[N] = (fact[N] - c2[N] - c3[N] - c4[N] - c5[N] - c6[N] + mod * 5) % mod;
    }
}

int main(){
    int T;
    cin >> T;
    solve();
    while(T--){
        int N;
        cin >> N;
        if(N == 1){
        cout << 1 << "\n";
        continue;
        }
        cout << (2 * (c2[N] + c3[N]) + 4 * (c4[N] + c5[N] + c6[N]) + 8 * c7[N]) % mod << "\n";
    }
}