#include <bits/stdc++.h>
using namespace std;
template <class T>
T gi() {
  T x = 0;
  bool f = 0;
  char c = getchar();
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') f = 1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f ? -x : x;
}
const int N = 1e6 + 10, Mod = 1e9 + 7;
int f[N][20][2], n, mi[20];
void pls(int &x, int y) {
  x += y;
  if (x >= Mod) x -= Mod;
}
int calc(int x, int y) { return n / (mi[x] * (y ? 3 : 1)); }
int main() {
  n = gi<int>();
  int c = log2(n);
  for (int i = mi[0] = 1; i <= c; i++) mi[i] = 2 * mi[i - 1];
  f[1][c][0] = 1;
  if (pow(2, c - 1) * 3 <= n) f[1][c - 1][1] = 1;
  for (int i = 1; i < n; i++)
    for (int j = 0; j <= c; j++)
      for (int k = 0; k < 2; k++) {
        pls(f[i + 1][j][k], 1ll * f[i][j][k] * (calc(j, k) - i) % Mod);
        if (j)
          pls(f[i + 1][j - 1][k],
              1ll * f[i][j][k] * (calc(j - 1, k) - calc(j, k)) % Mod);
        if (k)
          pls(f[i + 1][j][k - 1],
              1ll * f[i][j][k] * (calc(j, k - 1) - calc(j, k)) % Mod);
      }
  printf("%d\n", f[n][0][0]);
  return 0;
}
