#include #include using namespace std; #include using namespace atcoder; using mint=modint998244353; int main(void) { int n; cin >> n; vector inv(n+1, 1); vector fact(n+1, 1); vector factinv(n+1, 1); for(int i=2;i<=n;++i){ inv[i]=mint(1)/i; fact[i]=fact[i-1]*i; factinv[i]=factinv[i-1]*inv[i]; } mint ans=0; for(int i=1;2*i<=n;++i){ ans+=fact[n]*factinv[i]*factinv[i]*factinv[n-2*i]; } if(n>1){ ans*=inv[2]; } cout << ans.val() << endl; return 0; }