#include <bits/stdc++.h>
using namespace std;
template <class T>
bool maximize(T &x, const T &y) {
  if (x < y)
    x = y;
  else
    return false;
  return true;
}
const int mod = 1e9 + 7;
const int N = 1e6 + 7;
int n, Fmax, m;
int f[2][25][2], cnt[25][2];
void add(int &x, long long y) {
  y %= mod;
  (x += y) %= mod;
}
void Init() {
  int cur2 = 1, cur3 = 1;
  for (int i = 0; i <= m; i++) {
    cur3 = 1;
    for (int j = 0; j <= 1; j++) {
      if (n / cur2 >= cur3) {
        cnt[i][j] = n / (cur2 * cur3);
        maximize(Fmax, i + j);
      }
      cur3 *= 3;
    }
    cur2 *= 2;
  }
}
void DP() {
  int t0 = 0, t1 = 1;
  for (int i = 0; i <= 1; i++) f[0][Fmax - i][i] = cnt[Fmax - i][i];
  for (int i = 2; i <= n; i++) {
    memset(f[t1], 0, sizeof(f[t1]));
    for (int j = 0; j <= Fmax; j++)
      for (int y = 0; y <= 1; y++) {
        int x = j - y;
        if (x < 0) continue;
        if (cnt[x][y] >= i)
          add(f[t1][x][y], 1ll * f[t0][x][y] * (cnt[x][y] - i + 1));
        if (y > 0)
          add(f[t1][x][y - 1], 1ll * f[t0][x][y] * (cnt[x][y - 1] - cnt[x][y]));
        if (x > 0)
          add(f[t1][x - 1][y], 1ll * f[t0][x][y] * (cnt[x - 1][y] - cnt[x][y]));
      }
    t0 ^= 1;
    t1 ^= 1;
  }
  cout << f[t0][0][0];
}
int main() {
  if (fopen("exam.inp", "r"))
    freopen("exam.inp", "r", stdin), freopen("exam.out", "w", stdout);
  cin >> n;
  m = log2(n);
  Init();
  DP();
}
