#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

const ll mod = 998244353;

vector<vector<ll>> m_mul(vector<vector<ll>> &a, vector<vector<ll>> &b, ll mod) {
    ll n = a.size();
    vector<vector<ll>> ret(n, vector<ll>(n, 0));
    for (ll i = 0; i < n; i++) {
        for (ll j = 0; j < n; j++) {
            for (ll k = 0; k < n; k++) {
                ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]) % mod;
            }
        }
    }
    return ret;
}

vector<vector<ll>> p_mul(vector<vector<ll>> a, ll k, ll mod) {
    ll n = a.size();
    vector<vector<ll>> ret(n, vector<ll>(n, 0));
    for (ll i = 0; i < n; i++) {
        ret[i][i] = 1;
    }
    while (k > 0) {
        if (k % 2 == 1) {
            ret = m_mul(a, ret, mod);
        }
        a = m_mul(a, a, mod);
        k /= 2;
    }
    return ret;
}

int main() {
    ll T;
    cin >> T;
    while (T--) {
        ll N;
        cin >> N;
        vector<vector<ll>> mat = {{1, 1, 0, 0, 1, 1, 1}, {1, 1, 0, 0, 0, 0, 0},
                                  {1, 1, 1, 1, 0, 0, 0}, {1, 1, 1, 1, 0, 0, 0},
                                  {0, 0, 1, 1, 1, 1, 0}, {0, 0, 1, 1, 1, 1, 0},
                                  {0, 0, 0, 0, 1, 1, 1}};
        vector<vector<ll>> mat_pow = p_mul(mat, N, mod);

        vector<vector<ll>> mat2 = {{1, 1}, {1, 1}};
        vector<vector<ll>> mat2_pow = p_mul(mat2, N, mod);

        ll ans = (mat_pow[0][0] - mat2_pow[0][0] + mod) % mod;
        cout << ans << endl;
    }
}