import std;

void main () {
    // 前計算
    const long MOD = 998244353;
    const int MAX = 2*10^^5;
    long[] R = new long[](MAX+1);
    long[] E = new long[](MAX+1);
    R[1] = R[2] = 1;
    E[1] = 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;
    }

    int Q = readln.chomp.to!int;
    foreach (_; 0..Q) {
        int N = readln.chomp.to!int;
        long r = R[N] * R[N] % MOD;
        long e = E[N] * E[N] % MOD;
        r = r * 5 % MOD;
        writeln((MOD + r - e) % MOD);
    }
}

void read (T...) (string S, ref T args) {
    auto buf = S.split;
    foreach (i, ref arg; args) {
        arg = buf[i].to!(typeof(arg));
    }
}