#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main(){
  vector<mint> dp(1e6+1);
  for (int i(3);i <= 1e6;++i){
    mint t = mint(2).pow(i-1);
    dp[i] = dp[i]*t*(t/2);
    dp[i] -= (t/4-1)*(t/2)*(t/2);
    dp[i] += (t/2+1)*(t/2)/2-1;
  }
  int q; cin >> q;
  while(q--){
  	int n; cin >> n;
  	cout << (dp[n]+1).val() << endl;
  }
}