#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

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

const int MOD=998244353;
vector<vector<ll>> matrixmul(ll m,vector<vector<ll>> a,vector<vector<ll>> b){
  vector<vector<ll>> c(m,vector<ll>(m,0)); //c:和の単位元
  rep(i,m) rep(j,m) rep(k,m) c[i][j]=(c[i][j]+a[i][k]*b[k][j]%MOD)%MOD;
  return c;
}

vector<vector<ll>> matrixpow(ll m,vector<vector<ll>> vec,ll n){
  vector<vector<ll>> ans(m,vector<ll>(m,0));
  rep(i,m) ans[i][i]=1; //ans:積の単位元
  while(n){
    if(n&1) ans=matrixmul(m,ans,vec);
    vec=matrixmul(m,vec,vec);
    n>>=1;
  }
  return ans;
}

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

  int q;
  cin>>q;
  while(q--){
    vector<vector<ll>> A(3,vector<ll>(3));
    A[0]={1,1,0};
    A[1]={1,0,0};
    A[2]={0,0,1};
  
    ll n;
    cin>>n;
    if(n==1) cout<<4<<'\n';
    else if(n==2) cout<<MOD-4<<'\n';
    else{
      vector<vector<ll>> B=matrixpow(3,A,n-2);
      ll r=(B[0][0]+B[0][1]+B[0][2])%MOD;
      ll e=(3*B[0][0]+B[0][1]+B[0][2])%MOD;
      cout<<(5*r%MOD*r%MOD-e*e%MOD+MOD)%MOD<<'\n';
    }
  }
  
  return 0;
}