#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5+3, mod = 1e9+7;
int fac[maxn], ifac[maxn];

int modpow(int a, int b) {
	int ret = 1;
	for (; b; b>>=1) {
		if (b&1) ret = 1LL * ret * a % mod;
		a = 1LL * a * a % mod;
	}
	return ret;
}

void init() {
	fac[0] = 1;
	for (int i=1; i<maxn; i++) fac[i] = 1LL * fac[i-1] * i % mod;
	ifac[maxn-1] = modpow(fac[maxn-1], mod-2);
	for (int i=maxn-1; i>=0; i--) ifac[i-1] = 1LL * ifac[i] * i % mod;
	assert(1LL * fac[5] * ifac[5] % mod == 1);
}

void solve() {
	int n;
	cin >> n;

	int ans = 1;
	for (int i=2; i<=n; i++) {
		int mul = 0;
		for (int j=1; j*2<=i; j++) {
			int k = i - 1 - j;
			mul = (mul + 1LL * fac[j+k] * ifac[j] % mod * ifac[k] % mod) % mod; 
		}
		ans = 1LL * ans * mul % mod;
	}

	cout << ans << '\n';
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	init();
	int tcs = 1;
	// cin >> tcs;
	while (tcs--) {
		solve();
	}
	return 0;
}