#include <bits/stdc++.h>
#include <cstdio>
#define int long long
#define PII pair<int, int>
#pragma GCC optimize("Ofast")
#define NO {puts("No") ; return ;}
#define YES {puts("Yes") ; return ;}
#define pb push_back
#define endl "\n"
#define fi first
#define se second
#define IOS std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
using namespace std;
mt19937 rd(time(0));
const int N = 1e5 + 10, mod = 998244353;

long long qmi(int a, int b, int p) {
    long long res = 1;
    while (b) {
        if (b & 1) res = res * a % p;
        a = a * (long long)a % p;
        b >>= 1;
    }
    
    return res;
}

long long inv(long long a, long long mod) {
    return qmi(a, mod - 2, mod);
}

void solve() {
	int n;
	cin >> n;
	if (n == 1)
	{
		cout << 0 << endl;
		return;
	}
	cout << (2 * n - 1) * qmi(3, mod - 2, mod) % mod << endl;

} 

signed main() {
    IOS;
    int t; cin >> t;
    while (t -- ) 
    solve();
    
    return 0;
}