#include <bits/stdc++.h>
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int Read() {
  char c;
  c = getchar();
  int tsqua = 0;
  while (c != ' ' && c != '\n') {
    tsqua = (((tsqua << 1) << 1) << 1) + (tsqua << 1) + (int)(c - '0');
    c = getchar();
  }
  return tsqua;
}
int n;
inline int GetCountOfDivisors(int x, int y) {
  return n / ((1 << x) * (y ? 3 : 1));
}
int DP[1000010][21][2];
int p;
int main(int argc, char const *argv[]) {
  ios::sync_with_stdio(false);
  cin >> n;
  while ((1 << p) <= n) p++;
  p--;
  DP[1][p][0] = 1;
  if ((1 << p - 1) * 3 <= n) DP[1][p - 1][1] = 1;
  for (int i = 1; i < n; i++)
    for (int j = 0; j <= p; j++)
      for (int k = 0; k < 2; k++) {
        if (i)
          DP[i + 1][j][k] =
              (DP[i + 1][j][k] +
               1ll * DP[i][j][k] * (GetCountOfDivisors(j, k) - i)) %
              1000000007;
        if (j)
          DP[i + 1][j - 1][k] =
              (DP[i + 1][j - 1][k] +
               1ll * DP[i][j][k] *
                   (GetCountOfDivisors(j - 1, k) - GetCountOfDivisors(j, k))) %
              1000000007;
        if (k)
          DP[i + 1][j][k - 1] =
              (DP[i + 1][j][k - 1] +
               1ll * DP[i][j][k] *
                   (GetCountOfDivisors(j, k - 1) - GetCountOfDivisors(j, k))) %
              1000000007;
      }
  cout << DP[n][0][0];
  return 0;
}
