#include<iostream>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#include<math.h>
#include <numeric>
#include <random>
#include<map>
#include<queue>
#include<deque>
#include <bitset>
#include<stack>
#include<set>
#define int long long
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for (int i=0;i<(n);++i)
#define prep(i,n) for (int i=1;i<=(n);++i)
#define ep(i,j,n) for (int i=j+1;i<=(n);++i)
int INF = 900000000000000;
int mod=998244353;

signed main(){
  int r[300000];
  int e[300000];
  r[0]=1;r[1]=1;e[0]=1;e[1]=3;
  rep(i,290000){
    r[i+2]=r[i+1]+r[i];
    e[i+2]=e[i+1]+e[i];
    e[i+2]%=mod;r[i+2]%=mod;
  }
  int n;cin>>n;
  rep(i,n){
    int t;cin>>t;
    t--;
    int p=(5*r[t]*r[t])%mod;
    int q=(e[t]*e[t])%mod;
    cout<<(p-q+2*mod)%mod<<endl;
  }
}