#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int > 
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
using namespace std;
const int N = 1.4e7 + 7, mod = 1e9 + 7;
int qpow(int x, int y = mod - 2) {
	int res = 1;
	for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) res = (ll) res * x % mod;
	return res;
}
int fac[N], ifac[N], inv[N];
void init(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	L(i, 2, x) inv[i] = (ll) (mod - mod / i) * inv[mod % i] % mod;
	L(i, 1, x) fac[i] = (ll) fac[i - 1] * i % mod, ifac[i] = (ll) ifac[i - 1] * inv[i] % mod;
} 
int C(int x, int y) {
	return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}
int n, m, a[N];
string s;
int dp[N], xdp[N], tk;
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n, init(n);
	dp[1] = 1, tk = 1;
	int ns = 1;
	for(int k = 3; k <= n; k *= 3) {
		R(i, tk, 1) dp[i * 2] = dp[i], dp[i] = 0; 
		// dp[0] = 0;
		tk *= 2; 
		int lst = k / 3, cp = k - lst;
		L(i, 0, tk) xdp[i] = 0;
		R(i, tk, 0) if(dp[i]) {
			dp[i] = (ll) dp[i] * qpow(C(n - lst, cp)) % mod;
			L(j, 0, i) 
				(xdp[i - j] += (ll) dp[i] * C(i, j) %  mod * C(n - lst - i, cp - j) % mod) %= mod;
		}
		L(i, 1, tk) dp[i] = xdp[i], (ns += dp[i]) %= mod;
		// dp[0] = 0;
	}
	cout << ns << '\n';
	return 0;
}