#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)

ll modpow(ll A,ll N){
    ll res=1;
    while(N){
        if(N&1) res=res*A%mod;
        A=A*A%mod;
        N>>=1;
    }
    return res;
}

ll modinv(ll A){return modpow(A,mod-2);}

ll solve(ll N){
    ll ans=0;
    ll M=N%(mod-1)+(mod-1);
    ans+=modpow(2,(M*(M-1))/2);
    ll cnt=(modpow(2,2*M-3)+mod-modpow(3,M-2))*modpow(2,(M*(M-1))/2+(mod-1)*5-(2*M-3));
    cnt%=mod;
    ans+=cnt*(N-1);
    return ans%mod;
}

int main() {
    ll T;
    cin >> T;
    while(T--){
        ll N;
        cin >> N;
        cout << solve(N) << endl;
    }
    return 0;
}