#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using mint=modint998244353;
int main()
{
    int n;
    cin>>n;
    vector<vector<pair<mint,mint>>> dp(n+1,vector<pair<mint,mint>>(n+1));
    dp[0][0]=make_pair(0,1);
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(j>0){
                dp[i+1][j-1].first+=dp[i][j].first+(j-1)*dp[i][j].second;
                dp[i+1][j-1].second+=dp[i][j].second;
            }
            dp[i+1][j+1].first+=dp[i][j].first;
            dp[i+1][j+1].second+=dp[i][j].second;
        }
    }
    //for(int i=1;i<n;i++)for(int j=0;j<=n;j++)cout<<dp[i][j].first.val()<<(j==n?"\n":" ");
    //cout<<endl;
    //for(int i=1;i<n;i++)for(int j=0;j<=n;j++)cout<<dp[i][j].second.val()<<(j==n?"\n":" ");
    cout<<(dp[n][0].first).val()<<endl;


    return 0;
}