#include <bits/stdc++.h>
using namespace std;
#define ll long long

const ll mod=23333333;

ll n,m,mm;
ll f[4][110000],g[340][110000],h[110000];
ll now=1,last=0;
ll ans;

int main(){
	freopen("get_bag.in","r",stdin);
	freopen("get_bag.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n;
	m=sqrt(n);
	for (int i=1;i<m;i++){
		swap(now,last);
		for (int j=0;j<=n;j++){
			f[now][j]=f[last][j];
			if (j>=i) f[now][j]=(f[now][j]+f[now][j-i])%mod;
			if (j>=i*(i+1)) f[now][j]=(f[now][j]-f[last][j-i*(i+1)])%mod;
		}
	}
	mm=m/n;
	g[0][0]=1;
	h[0]=1;
	for (int i=1;i<=mm;i++){
		for (int j=0;j<=n;j++){
			if (j>=m) g[i][j]=g[i-1][j-m];
			if (j>=i) g[i][j]=(g[i][j]+g[i][j-i])%mod;
			h[j]=(h[j]+g[i][j])%mod;
		}
	}
	for (int i=0;i<=n;i++){
		ans=(ans+f[now][i]*h[n-i])%mod;
	}
	ans=(ans%mod+mod)%mod;
	cout<<ans<<'\n';
	return 0;
}