51nod1201 整数划分

#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
const int nmax=5e4+5;
const int mod=1e9+7;
int dp[nmax][355];
int main(){
	int n;scanf("%d",&n);
	dp[1][1]=1;
	rep(i,2,n) rep(j,1,min(i,350)) dp[i][j]=(dp[i-j][j]+dp[i-j][j-1])%mod;
	int ans=0;
	rep(i,1,350) ans=(ans+dp[n][i])%mod;
	printf("%d\n",ans);
	return 0;
}