#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const int maxn=50005;
const int maxm=505;
int n;
int dp[maxn][maxm];
int main(){
scanf("%d",&n);
dp[0][0]=1;
for(int i=1;i<=n;++i){
for(int j=1;j<maxm;++j){
if(i>=j) dp[i][j]=((long long)dp[i-j][j]+dp[i-j][j-1])%mod;
}
}
long long ans=0;
for(int j=1;j<maxm;++j){
ans=(ans+dp[n][j])%mod;
}
printf("%lld\n",ans);
return 0;
}