#include "bits/stdc++.h"
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define revrep(i, a, n) for (int i = n; i >= a; --i)
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
using namespace std;

string to_string(const string &s) { return '"' + s + '"'; }
template<class A> string to_string(A v) {
	bool first = 1;
	string res = "{";
	for (const auto &x: v) {
		if (!first) res += ", ";
		first = 0;
		res += to_string(x);
	}
	res += "}";
	return res;
}
void debug_out() { cerr << endl; }
template<class H, class... T> void debug_out(H h, T... t) {
	cerr << " " << to_string(h);
	debug_out(t...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

using vi = vector<int>;
using ll = long long;
using pii = pair<int, int>;

template<const int &mod> struct Z {
	int x;
	Z(ll a = 0): x(a % mod) { if (x < 0) x += mod; }
	explicit operator int() const { return x; }
	Z& operator +=(Z b) { x += b.x; if (x >= mod) x -= mod; return *this; }
	Z& operator -=(Z b) { x -= b.x; if (x < 0) x += mod; return *this; }
	Z& operator *=(Z b) { x = 1ll * x * b.x % mod; return *this; }
	friend Z operator +(Z a, Z b) { return a += b; }
	friend Z operator -(Z a, Z b) { return a -= b; }
	friend Z operator *(Z a, Z b) { return a *= b; }

	Z pow(ll k) const {
		Z res = 1, a = *this;
		for (; k; k >>= 1, a = a * a)  if (k & 1) res = res * a;
		return res;
	}
	Z& operator /=(Z b) {
		assert(b.x != 0);
		*this = *this * b.pow(mod - 2);
		return *this;
	}
	friend Z operator /(Z a, Z b) { return a /= b; }
	friend string to_string(Z a) { return to_string(a.x); }
};
const int mod = 1e9 + 7;
using Mint = Z<mod>;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	vi pw3(16);
	pw3[0] = 1;
	rep(i, 1, 15) pw3[i] = pw3[i - 1] * 3;

	int n; cin >> n;

	vector<Mint> fac(n + 1), ifac(n + 1);
	fac[0] = ifac[0] = ifac[1] = 1;
	rep(i, 2, n) ifac[i] = ifac[mod % i] * (mod - mod / i);
	rep(i, 1, n) ifac[i] *= ifac[i - 1];
	rep(i, 1, n) fac[i] = fac[i - 1] * i;

	auto binom = [&](int n, int m) {
		if (m < 0 || n < m) return Mint{0};
		else return fac[n] * ifac[m] * ifac[n - m];
	};
	auto ibinom = [&](int n, int m) {
		if (m < 0 || n < m) return Mint{0};
		else return ifac[n] * fac[m] * fac[n - m];
	};
	vector<Mint> dp{0, 1};
	Mint ans = 0;
	rep(i, 0, 15) {
		ans += i * dp[0];
		int unvac = n - pw3[i];
		int bound = min(unvac, 1 << i);
		if (unvac < 0) break;
		int nunvac = max(0, n - pw3[i + 1]);
		int nbound = min(nunvac, 1 << (i + 1));
		vector<Mint> tmp(min(unvac, 1 << (i + 1)) + 1), ndp(nbound + 1);
		rep(j, 1, bound) if (dp[j].x) {
			int nj = min(j * 2, unvac);
			tmp[nj] += dp[j];
		}
		// debug(i, unvac, nunvac, tmp, nbound);
		rep(j, 1, min(unvac, 1 << (i + 1))) {
			rep(k, 0, min(j, nbound)) {
				ndp[k] += tmp[j] * binom(j, k) * binom(unvac - j, nunvac - k) * ibinom(unvac, nunvac);
			}
		}
		swap(dp, ndp);
	}
	printf("%d\n", (int)ans);
	return 0;
}