#include<bits/stdc++.h>
#define mod 23333333
using namespace std;
int n,m,g[325][100005],f[325][100005],sum[100005],ans;
int main(){
    freopen("get_bag.in","r",stdin);
    freopen("get_bag.out","w",stdout);
    scanf("%d",&n);m=sqrt(n);
    f[0][0]=1;
    for(int i=1;i<=m;i++){
        memset(sum,0,sizeof(sum));
        for(int j=0;j<=n;j++){
            f[i&1][j]=(sum[j%i]+f[1-(i&1)][j])%mod;
            sum[j%i]=(sum[j%i]+f[1-(i&1)][j])%mod;
            if(j>=i*i)
			sum[j%i]=(sum[j%i]-f[1-(i&1)][j-i*i]+mod)%mod;
        }
    }
    g[0][0]=1;
    for (int i=1;i<=m;i++)
    for (int j=0;j<=n;j++){
        if (j>=i) 
		(g[i][j]+=g[i][j-i])%=mod;
        if (j>=m+1) 
	    (g[i][j]+=g[i-1][j-m-1])%=mod;
    }
    for (int i=0;i<=m;i++)
    for (int j=0;j<=n;j++){
    	ans=(ans+(long long)f[m&1][j]*g[i][n-j]%mod)%mod;
	}
    
    printf("%d\n",ans);
}