#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long;

const ll mod = 1e9 + 7;

long long modpow(long long a, long long b, long long mod) {
	long long ret = 1;
	for (; b > 0; a = a * a % mod, b /= 2) if (b & 1) ret = ret * a % mod;
	return ret;
}

long long modinv(long long a, long long mod) {
	return modpow(a, mod - 2, mod);
}

int main() {
	static ll C[3000][3000];
	C[0][0] = 1;
	rep(i, 1, 3000) {
		C[i][0] = 1;
		rep(j, 1, 3000) {
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
		}
	}

	static ll dp[3000];
	dp[0] = dp[1] = 1;
	ll inv = modinv(2, mod);
	rep(i, 2999) {
		rep(j, i + 1) {
			(dp[i + 1] += dp[j] * dp[i - j] % mod * C[i][j] % mod) %= mod;
		}
		(dp[i + 1] *= inv) %= mod;
	}

	ll n;
	cin >> n;
	if (n <= 2) {
		cout << 0 << endl;
		return 0;
	}

	ll ans = dp[n] * 2 % mod;
	cout << ans << endl;
	return 0;
}