#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;

int main() {
  vector<mint> R(200001), E(200001);
  R[1] = 1;
  R[2] = 1;
  E[1] = 1;
  E[2] = 3;
  for (int i = 3; i <= 200000; i++) {
    R[i] = R[i - 1] + R[i - 2];
    E[i] = E[i - 1] + E[i - 2];
  }
  int Q;
  cin >> Q;
  while (Q--) {
    int N;
    cin >> N;
    mint ans = 5 * R[N] * R[N] - E[N] * E[N];
    cout << ans.val() << endl;
  }
  return 0;
}