#Partition

/***** TheAnshul *****/

#include<bits/stdc++.h>
#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define    endl        '\n'
#define mii         map<ll int,ll int>
#define msi         map<string,ll int>
#define mis         map<ll int, string>
#define rep(i,a,b)    for(ll int i=a;i<b;i++)
#define mpi         map<pair<ll int,ll int>,ll int>
#define pii         pair<ll int,ll int>
#define vi          vector<ll int>
#define vii         vector<pair<ll int, ll int>>
#define vs          vector<string>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll int)x.size()
#define hell        9799519364
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
#define what_is(x)  cerr << #x << " is " << x << endl;
using namespace std;
#define N  7005
ll dp[N][N];
ll fun(ll n,ll m)
{
    if(n<=1)
    {
        return 1;
    }
    if(m>n)
        return fun(n,n);
    if(dp[n][m]!=-1)
        return dp[n][m];
    ll sum=0;
    rep(k,1,m+1)
    {
        sum+=fun(n-k,k);
        sum%=hell;
    }
    dp[n][m]=sum%hell;
    return sum;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int TESTS=1;
//    cin>>TESTS;
    while(TESTS--)
    {
        ll n;
        cin>>n;
        rep(i,0,n+2)
        {
            rep(j,0,n+2)
            {
                dp[i][j]=-1;
            }
        }
        cout<<fun(n,n);
    }
    return 0;
}