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

#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;

ll N;
const int MAX_N = 2000;
const ll MOD = 1e9 + 7;
ll dp [MAX_N + 1] [MAX_N + 1];

int main()
{
	scanf("%lld",&N);
	
	FOR(i,1,N + 1) dp [1] [i] = i;
	FOR(i,2,N + 1){
		vector<ll> acc(N + 2,0);
		FOR(j,0,N + 1){
			acc [j + 1] = (acc [j] + dp [i - 1] [j]) % MOD;
		}
		FOR(j,1,N + 1){
			dp [i] [j] = acc [min<ll>(N + 1,j + (i - 1))] - acc [0];
			dp [i] [j] = (dp [i] [j] % MOD + MOD) % MOD;
		}
	}
	ll ans = accumulate(dp [N - 1],dp [N],0ll);

	memset(dp,0,sizeof(dp));
	FOR(i,1,N + 1) dp [1] [i] = 1;
	FOR(i,2,N + 1){
		vector<ll> acc(N + 2,0);
		FOR(j,0,N + 1){
			acc [j + 1] = (acc [j] + dp [i - 1] [j]) % MOD;
		}
		FOR(j,1,N + 1){
			dp [i] [j] = acc [min<ll>(N + 1,j + (i - 1))] - acc [0];
			dp [i] [j] = (dp [i] [j] % MOD + MOD) % MOD;
		}
	}

	ans -= dp [N - 1] [N];
	ans = (ans % MOD + MOD) % MOD;
	printf("%lld\n",ans);

	return 0;
}