#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cstring>
#include <stack>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)
using mint = modint998244353;
int main(){
  int q;
  cin >> q;
  vector<mint> r(200001);
  vector<mint> e(200001);
  for (int i = 1; i <= 200000;i++){
    if (i == 1) r[i] = 1;
    else if (i == 2) r[i] = 1;
    else r[i] = r[i-1] + r[i-2];
  }
  for (int i = 1; i <= 200000;i++){
    if (i == 1) e[i] = 1;
    else if (i == 2) e[i] = 3;
    else e[i] = e[i-1] + e[i-2];
  }
  while(q--){
    int n;
    cin >> n;
    cout << (mint(5)*r[n]*r[n]-e[n]*e[n]).val() << endl;
  }
  return 0;
}