#include <iostream>
using namespace std;

long long modpow(long long a, long long b, long long m) {
	long long p = 1, q = a;
	for (int i = 0; i < 33; i++) {
		if ((b / (1LL << i)) % 2 == 1) { p *= q; p %= m; }
		q *= q; q %= m;
	}
	return p;
}

long long Div(long long a, long long b, long long m) {
	return (a * modpow(b, m - 2, m)) % m;
}

long long solve(long long N, long long m) {
	long long ret = 1;
	for (long long i = N + 1; i <= 2 * N; i++) { ret *= i; ret %= m; }
	for (long long i = 1; i <= N; i++) { ret = Div(ret, i, m); ret %= m; }
	return ret;
}

int main() {
	long long K; cin >> K;
	if (K % 2 == 1) { cout << "0" << endl; return 0; }
	cout << solve(K / 2, 1000000007) << endl;
	return 0;
}