// Source: https://usaco.guide/general/io

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

typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define ms memset
#define pb push_back
#define fi first
#define se second
#define inp(n, a) vector<ll> a;for(int i=0;i<n;i++){ll now;cin>>now;a.pb(now);}
#define all(a) a.begin(),a.end()
#define show(a) for(long long loppls=0;loppls<(long long)(a.size()-1);loppls++)cout<<a[loppls]<<' ';cout<<a[a.size()-1];

long long binpow(long long a, long long b, long long m) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}

ll sum2(ll a, ll l, ll n){return (n*(a+l))/2;}
ll ceil2(ll a, ll b){return (a+b-1)/b;}

const long long INF=1e16,MAX=200020,MOD=998244353;

void solve() {
    ll q;cin>>q;
    ll r[MAX],e[MAX];
    r[1]=1;r[2]=1;
    e[1]=1;e[2]=3;
    for(int i=3;i<MAX;i++){
        r[i]=(r[i-1]+r[i-2])%MOD;
        e[i]=(e[i-1]+e[i-2])%MOD;
    }
    while(q--){
        ll x;cin>>x;
        //cout<<r[x]<<' '<<e[x]<<'\n';
        ll ans=(((5*((r[x]%MOD)*(r[x]%MOD))%MOD)%MOD)-((((e[x])%MOD)*((e[x])%MOD))%MOD))%MOD;
        cout<<(ans<0?MOD+ans:ans)<<'\n';
    }
}

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

	solve();
}