#include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef pair<ll,ll> P; typedef vector<ll> VI; typedef vector<VI> VVI; #define REP(i,n) for(int i=0;i<n;i++) #define ALL(v) v.begin(),v.end() constexpr ll MOD=998244353; constexpr ll INF=1e18; ll power(ll x, ll y){ x%=MOD; ll ret=1; while(y){ if(y&1) ret=ret*x%MOD; x=x*x%MOD; y>>=1; } return ret; } ll divid(ll x, ll y){ x%=MOD; return x*power(y,MOD-2)%MOD; } int main(){ int n; cin >> n; ll a=1, b=1, ans=0; ans+=2*power(2,n)%MOD; for(int i=2;i<=n;i+=2){ a=(a*(n-i+1))%MOD*(n-i+2)%MOD; b=(b*i)%MOD*(i-1)%MOD; ans=(ans+divid(a,b)*power(2,abs(i-(n-i))+1)%MOD)%MOD; } cout << ans << endl; return 0; }