#include<bits/stdc++.h>
using namespace std;

const long long int MAX = 510000;
const long long int MOD = 998244353;

long long int fac[MAX], finv[MAX], inv[MAX];

void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for(int i=2;i<MAX;i++){
    fac[i] = fac[i-1]*i%MOD;
    inv[i] = MOD-inv[MOD%i]*(MOD/i)%MOD;
    finv[i] = finv[i-1]*inv[i]%MOD;
  }
}

long long int COM(long long int n,long long int k){
  if(n<k) return 0;
  if(n<0||k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}

long long int modpow(long long int a,long long int n,long long int mod){
  long long int res = 1;
  while(n>0){
    if(n&1) res = res*a%mod;
    a = a*a%mod;
    n >>= 1;
  }
  return res;
}

int main(){
  COMinit();
  int T;
  cin >> T;
  for(int i=0;i<T;i++){
    int N;
    cin >> N;
    long long int ans = 0;
    for(int j=1;j<=N;j++){
      long long int plus = COM(N-1,j-1);
      plus *= modpow(2,j,MOD);
      plus %= MOD;
      ans += plus;
      ans %= MOD;
    }
    cout << ans << endl;
  }
}