#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

const int MAX = 2e5 + 1;
const long long MOD = 998244353;

int main(void) {
  int q;
  cin >> q;

  vector<long long> R(MAX, 1);
  vector<long long> E(MAX, 1);

  E[2] = 3;

  for (int i = 3; i < MAX; ++i) {
    R[i] = (R[i - 1] + R[i - 2]) % MOD;
    E[i] = (E[i - 1] + E[i - 2]) % MOD;
  }

  while (q--) {
    long long n;
    cin >> n;

    long long val = 5 * (R[n] * R[n]) % MOD;
    val -= (E[n] * E[n]) % MOD;

    val = (val + MOD) % MOD;

    cout << val << endl;
  }

  return 0;
}