#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 100005
#define int long long
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,k,f[N],g[N],ans,x,y,z;const int mod=23333333;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("get_bag.in","r",stdin);freopen("get_bag.out","w",stdout);
    n=read();
    f[0]=1;
    fo(i,1,n)
    {
        fo(j,0,n)
        {
            g[j]=f[j];
            if(j>=i)g[j]+=g[j-i];
            if(g[j]>=mod)g[j]-=mod;
        }
        fo(j,i,n)
        {
            int sum=g[j-i];
            if(j>=i*(i+1))sum-=g[j-i*(i+1)];
            if(sum<0)sum+=mod;
            f[j]+=sum;
            if(f[j]>=mod)f[j]-=mod;
        }
    }
    printf("%lld",f[n]);
    return 0;
}