#include<bits/stdc++.h>
#define int long long
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
template<typename T>istream&operator>>(istream&I,vector<T>&v){for(auto&i:v)I>>i;return I;}
template<typename T>ostream&operator<<(ostream&O,vector<T>&v){for(auto&i:v)O<<i<<' ';return O;}
namespace AC{
const int mod=1e9+7;
void solve(){
	int n;
	cin>>n;
	vector<vector<int>>dp(n+1,vector<int>(n+1)),DP(n+1,vector<int>(n+1));
	dp[0][0]=1;
	DP[1][1]=1;
	vector<int>a(n);
	for(int i=2;i<n;i++)a[i]=i-2;
	for(int i=1;i<=n;i++){
		vector<int>s=dp[i-1],t=DP[i-1];
		for(int j=1;j<=n;j++){
			(s[j]+=s[j-1])%=mod;
			(t[j]+=t[j-1])%=mod;
		}
		for(int j=1;j<=n;j++){
			dp[i][j]=s[min(n,j+a[i-1])];
			if(i!=1)DP[i][j]=t[min(n,j+a[i-1])];
		}
	}
	int sum=0;
	for(int i=1;i<=n;i++)(sum+=dp[n][i])%=mod;
	cout<<(sum-DP[n][n]+mod)%mod<<endl;
}
}
signed main(){
	int t=1;
	//cin>>t;
	while(t--)AC::solve();
}