#include <iostream>
using namespace std;
const int mod = 1000000007;
int a[10000];
int solve(int n){
	int *A = a + n;
	A[0] = 1; A[-1] = 0;
	int k = 0, e = 1;
	for (int i = 0; i <= n; ++i){
		int Am = 0; 
		A[k + e] = 0; 
		e = -e;
		for (int j = 0; j <= i; ++j){
			Am += A[k]; 
			if (Am >= mod) Am -= mod;
			A[k] = Am; 
			k += e;
		}
	}
	return n % 2 ? A[n / 2] : A[-n / 2];
}

int main()
{
	int n; 
	cin >> n;
	cout << solve(n) << endl;
	return 0;
}