#include<bits/stdc++.h>
#define int long long
#define MAXN 2000
#define MOD 1000000007
using namespace std;

inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		x=x*10+ch-48;
		ch=getchar();
	}
	return x*f;
}

int n,ans;
int from[(MAXN<<1)+5],to[(MAXN<<1)+5];

signed main(){
//	freopen("","r",stdin);
//	freopen("","w",stdout);
	n=read();
	for(int i=2;i<=n;i++){
		from[MAXN+i]=i-1;
	}
	for(int i=2;i<n;i++){
		memset(to,0,sizeof(to));
		for(int j=1;j<=n;j++){
			to[MAXN+j-i+2]+=from[MAXN+j];
		}
		for(int j=0;j<=(MAXN<<1);j++){
			to[j+1]=(to[j+1]+to[j])%MOD;
		}
		swap(from,to);
	}
	for(int i=1;i<=n;i++){
		ans+=from[MAXN+i];
	}
	memset(from,0,sizeof(from));
	for(int i=1;i<=n;i++){
		from[MAXN+i]=1;
	}
	for(int i=2;i<n;i++){
		memset(to,0,sizeof(to));
		for(int j=1;j<=n;j++){
			to[MAXN+j-i+2]+=from[MAXN+j];
		}
		for(int j=0;j<=(MAXN<<1);j++){
			to[j+1]=(to[j+1]+to[j])%MOD;
		}
		swap(from,to);
	}
	for(int i=1;i<n;i++){
		ans+=from[MAXN+i];
	}
	printf("%lld\n",ans%MOD);
	return 0;
}