#include <bits/stdc++.h>
#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
#include <iomanip>
#include<set>
#include <numeric>
#include<string>
using ll = long long;
using namespace std;

int main()
{
    ll n, max1 = -1, mod = 998244353;
    cin >> n;
    vector<ll> c(n);
    for (int i = 0; i < n; i++){
        cin >> c[i];
        max1 = max(max1, c[i]);
    }
    vector<ll> a(max1), sum(max1);
    a[0] = 2;
    sum[0] = 2;
    for (int i = 1; i < max1; i++){
        a[i] = (sum[i-1]*2 + 2)%mod;
        sum[i] = (sum[i-1] + a[i])%mod; 
    }
    for (int i = 0; i < n; i++){
        cout << a[c[i] - 1] << endl;
    }
}