#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  const int mod = 998244353, b = 1e6, inv2 = 499122177;
  vector<long long> p2(b + 1), x(b + 1), y(b + 1);
  p2[0] = 1;
  for (int i = 0; i < b; ++i) p2[i + 1] = p2[i] * 2LL % mod;
  for (int i = 3; i <= b; ++i)
  {
    x[i] = (p2[i - 2] + mod - 1) % mod;
    y[i] = (p2[i - 2] - 1 + mod) * p2[i - 2] % mod * inv2 % mod + x[i - 1] * p2[i - 2] % mod * p2[i - 2] % mod + y[i - 1] * p2[i - 1] % mod * p2[i - 2] % mod;
    y[i] %= mod;
  }
  int t;
  cin >> t;
  while (t--)
  {
    int n;
    cin >> n;
    if (n < 3)
    {
      cout << 1 << '\n';
      continue;
    }
    long long ans = (x[n] + y[n] + 1)% mod;
    cout << ans << '\n';
  }
}