#include <iostream>
#include <atcoder/modint>
using namespace std;

using mint = atcoder::modint998244353;

mint solve(int N) {
    if (N == 1) return 1;
    const auto E = (long long)(N) * (N - 1) / 2;

    mint e = 1 + mint(N - 1) / 2;

    e += mint(N - 1) * mint(2).inv() * (mint(1) - (mint(3) / 4).pow(N - 2));

    return e * mint(2).pow(E);
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        cout << solve(N).val() << '\n';
    }
}