#include<bits/stdc++.h>

#define int ll
#define rep(i, N) for(int i = 0; i < (int)N; ++i)
#define rep1(i, N) for(int i = 1; i <= (int)N; ++i)
#define per(i, N) for(int i = N-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define TakAo(ans) ans ? cout << "Takahashi\n" : cout << "Aoki\n"
#define YesNo(ans) ans ? cout << "Yes\n" : cout << "No\n"
#define yesno(ans) ans ? cout << "yes\n" : cout << "no\n"
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define mkpr make_pair
#define mktpl make_tuple

using namespace std;
using ll = int64_t;
using ld = long double;

const ld EPS = 1e-8;
const ll INF = 1e9+10;
const int MOD = 998244353;
//const int MOD = 1e9+7;
const int NIL = -1;

ll cel(ll a, ll b){ return (a + b - 1) / b; }
ll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : a; }
ll Lcm(ll a, ll b){ return a / Gcd(a, b) * b; }
ll sq(ll a){ return a * a; }
template<class T> bool chmin(T &a, T b){ if(a > b){ a = b; return 1;} return 0; }
template<class T> bool chmax(T &a, T b){ if(a <= b){ a = b; return 1;} return 0; }

using P = pair<int, int>;
using Tpl = tuple<int, int, int>;
using vvec= vector<vector<int>>;
using vvvec = vector<vector<vector<int>>>;

int N, m[110][2];

ll dp(int n, bool isfill){
	if(m[n][isfill]) return m[n][isfill];
	if(n == N) return 1;

	ll res;
	if(isfill){
		res = (2 * dp(n+1, 0)) % MOD;
	}
	else{
		res = dp(n, 1);
		res = (res + dp(n+1, 0)) % MOD;
	}

	return m[n][isfill] = res;
}

void Main(){
	int T; cin >> T;
	while(T--){
		cin >> N;
	    rep(i, N+1) m[i][0] = m[i][1] = 0;
		cout << dp(0, 1) << endl;
	}
}

signed main(){
    cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(15);
	Main();
    return 0;
}