#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
using namespace std;

#define MOD 1000000007LL
long long int dp[2017][2017][2];
int n;

int main(){
	cin >> n;
	if (n <= 2){
		puts("0");
		return 0;
	}
	dp[1][1][0] = dp[1][1][1] = 1LL;
	for (int i = 2; i <= n; i++){
		for (int j = 1; j <= i; j++){
			dp[i][j][0] += dp[i - 1][j-1][1];
			dp[i][j][1] += dp[i - 1][j][0];
		}
		for (int j = 1; j <= i; j++){
			dp[i][j][1] += dp[i][j - 1][1];
			if (dp[i][j][1] >= MOD){
				dp[i][j][1] %= MOD;
			}
		}
		for (int j = i; j >= 1; j--){
			dp[i][j][0] += dp[i][j + 1][0];
			if (dp[i][j][0] >= MOD){
				dp[i][j][0] %= MOD;
			}
		}
	}
	long long int ans = dp[n][1][0] + dp[n][n][1];
	ans %= MOD;
	printf("%lld\n", ans);
	return 0;
}