#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1.4e7 + 10, MOD = 1e9 + 7;
int n;
int f[40000][30], jc[N], inv[N];
int power(int a, int b) {
	int ans = 1;
	for(; b; b >>= 1) {
		if(b & 1) ans = ans * a % MOD;
		a = a * a % MOD;
	}
	return ans;
}
int C(int n, int m) {
	if(n < m) return 0;
	return jc[n] * inv[m] % MOD * inv[n - m] % MOD;
}
int dfs(int a, int b, int u) {
	if(b >= n || a == 0) return 0;
	if(f[a][u] != -1) return f[a][u];
	int res = 1, da = min(n - a - b, a), db = min(n - b, 2 * b), cnt = C(n - b, db);
	int tt = power(cnt, MOD - 2);
	for(int i = max(0ll, db - (n - b - a - da)); i <= min(db, a + da); i++) {
		res = (res + C(a + da, i) * C(n - b - a - da, (db - i)) % MOD * tt % MOD * dfs(a + da - i, b + db, u + 1)) % MOD;
	}
	return f[a][u] = res;
}
signed main() {
	jc[0] = inv[0] = 1;
	for(int i = 1; i < N; i++) jc[i] = jc[i - 1] * i % MOD;
	inv[N - 1] = power(jc[N - 1], MOD - 2);
	for(int i = N - 2; i >= 1; i--) inv[i] = inv[i + 1] * (i + 1) % MOD;
	memset(f, -1, sizeof(f));
	cin >> n;
	cout << dfs(1, 1, 0) << endl;
	return 0;
}