#include #include using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; using mint = modint998244353; const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n) - 1; i >= 0; --i) #define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } #include template std::vector> matrixMul(const std::vector>&A, const std::vector>&B) { std::vector> C(A.size(), std::vector(B[0].size())); for (int i = 0; i < (int)A.size(); ++i) { for (int k = 0; k < (int)A[0].size(); ++k) { for (int j = 0; j < (int)B[0].size(); ++j) { C[i][j] += A[i][k] * B[k][j]; } } } return C; } template std::vector> matrixPow(long long n, const std::vector> &mat) { int size = (int)mat.size(); vector> mret(size, vector(size)); for (int i = 0; i < size; ++i) { mret[i][i] = 1; } auto cmat = mat; while (n > 0) { if (1 & n) mret = matrixMul(cmat, mret); cmat = matrixMul(cmat, cmat); n >>= 1; } return mret; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int t; cin >> t; while (t--) { long long n; cin >> n; vector mul(7, vector(7)); mul[0] = { 1,1,0,0,1,1,1 }; mul[1] = { 1,1,0,0,0,0,0 }; mul[2] = { 1,1,1,1,0,0,0 }; mul[3] = { 1,1,1,1,0,0,0 }; mul[4] = { 0,0,1,1,1,1,0 }; mul[5] = { 0,0,1,1,1,1,0 }; mul[6] = { 0,0,0,0,1,1,1 }; mul = matrixPow(n, mul); mint ans = mul[0][0]; {// 1,-1 vector mul(2, vector(2)); mul[0] = { 1,1 }; mul[1] = { 1,1 }; mul = matrixPow(n, mul); ans -= mul[0][0]; } cout << ans.val() << endl; } return 0; }