#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int n, fact[N], memo[22][2][N];
int f(int x, int y) {
  int dem = (1 << x);
  if (y) dem *= 3;
  return n / dem;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  fact[0] = 1;
  for (int i = 1; i < N; ++i) {
    fact[i] = (fact[i - 1] * 1LL * i) % mod;
  }
  cin >> n;
  if (n <= 2) {
    cout << 1;
    return 0;
  }
  int mxPow2 = 0;
  while ((1 << mxPow2) <= n) ++mxPow2;
  int pow2 = 1 << (mxPow2 - 1);
  assert(pow2 * 2 > n);
  memo[mxPow2 - 1][0][1] = 1;
  if (pow2 / 2 * 3 <= n) {
    assert(mxPow2 - 2 >= 0);
    memo[mxPow2 - 2][1][1] = 1;
  }
  for (int i = 1; i <= n; ++i) {
    for (int x = 0; x < mxPow2; ++x) {
      for (int y = 0; y <= 1; ++y) {
        int &curr = memo[x][y][i];
        if (f(x, y) >= i - 1) {
          curr += memo[x][y][i - 1] * 1LL * (f(x, y) - (i - 1)) % mod;
          if (curr >= mod) curr -= mod;
        }
        if (x + 1 < mxPow2) {
          curr += (memo[x + 1][y][i - 1] * 1LL * (f(x, y) - f(x + 1, y))) % mod;
          if (curr >= mod) curr -= mod;
        }
        if (y == 0) {
          curr += (memo[x][y + 1][i - 1] * 1LL * (f(x, y) - f(x, y + 1))) % mod;
          if (curr >= mod) curr -= mod;
        }
        assert(0 <= curr && curr < mod);
      }
    }
  }
  cout << memo[0][0][n];
}
