#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 23333333
#define MAXN 3010
inline ll read(){
	ll x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
ll dp[MAXN][MAXN];
ll n;
int main(){
	freopen("get_bag.in","r",stdin);
	freopen("get_bag.out","w",stdout);
	n=read();
	dp[0][0]=1;
	for(int i=1;i<=n;i++){
		for(int j=0;j<=n;j++){
			dp[i][j]=dp[i-1][j];
			for(int k=1;k<=i;k++){
				if(j-i*k>=0){
					dp[i][j]=(dp[i][j]+dp[i-1][j-i*k])%mod;
				}else break;
			}
		}
	}
	cout<<dp[n][n];
	return 0;
}