#include<bits/stdc++.h>
using namespace std;
int n,m,dp[100005];
const int M=23333333;
int main(){
    freopen("get_bag.in","r",stdin);
    freopen("get_bag.out","w",stdout);
    cin>>n;
    while(m*m<=n) m++;
    dp[0]=1;
    for(int i=1;i<=n;i++){
        if(i<=m){
            for(int j=n;j>=i;j--){
                for(int k=1;k*i<=j&&k<=i;k++){
                    dp[j]+=dp[j-k*i];
                    if(dp[j]>M) dp[j]-=M;
                }
            }
        }else{
            for(int j=i;j<=n;j++){
                dp[j]+=dp[j-i];
                if(dp[j]>M) dp[j]-=M; 
            }
        }
    }
    cout<<dp[n];
    return 0;
}