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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto&& e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S>
bool chmin(T& a, const S& b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
bool chmax(T& a, const S& b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

const int MOD=998244353;
void solve();

int main(){
  int T;
  cin>>T;
  rep(T)solve();
}

ll modpow(ll a,ll n){
  ll ret=1,t=a;
  while(n>0){
    if(n&1)ret=ret*t%MOD;
    t=t*t%MOD;
    n/=2;
  }
  return ret;
}

void add(ll &a,ll b){
  a=(a+b)%MOD;
}

using mat8 = array<array<ll,8>,8>;

mat8 matmul(mat8 a,mat8 b){
  mat8 ret;
  rep(i,8)rep(j,8)ret[i][j]=0;
  rep(k,8){
    rep(i,8){
      rep(j,8)add(ret[i][j],a[i][k]*b[k][j]);
    }
  }
  return ret;
}

mat8 matpow(mat8 a,ll n){
  mat8 ret,t=a;
  rep(i,8)rep(j,8)ret[i][j]=(i==j);
  while(n>0){
    if(n&1)ret=matmul(ret,t);
    t=matmul(t,t);
    n/=2;
  }
  return ret;
}

void solve(){
  ll N;
  cin>>N;
  mat8 a;
  rep(i,8)rep(j,8)a[i][j]= 0;
  rep(i,6){
    rep(j,4){
      a[i][(i-i%2+j)]=1;
    }
  }
  a[4][6]=0,a[5][6]=0;
  a[4][0]=1,a[5][0]=1;
  a[7]={1,0,0,0,0,0,0,1};
  auto ret=matpow(a, N);
  ll ans=ret[0][0];
  add(ans,-modpow(2,N-1));
  add(ans,MOD);
  cout<<ans<<'\n';
}