#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
const long long MOD = 1e9 + 7;
int n;
long long DP[2][25][2];
inline int Read() {
  int x = 0, f = 0;
  char c = getchar();
  while (!isdigit(c)) {
    f |= c == '-';
    c = getchar();
  }
  while (isdigit(c)) {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  return f ? -x : x;
}
inline void Write(const long long &x) {
  if (x < 0) {
    putchar('-');
    Write(-x);
    return;
  }
  if (x > 9) {
    Write(x / 10);
  }
  putchar((x % 10) ^ 48);
  return;
}
inline long long Solve(const int &x, const int &y) {
  return (1LL << x) * (3LL - y);
}
int main() {
  n = Read();
  register int i, j, Log;
  for (Log = -1; (1 << (Log + 1)) <= n; ++Log)
    ;
  if ((1 << (Log - 1)) * 3 <= n) {
    DP[1][Log - 1][1] = 1;
  }
  DP[1][Log][0] = 1;
  for (i = 2; i <= n; ++i) {
    for (j = 0; j <= Log; ++j) {
      DP[i & 1][j][0] =
          DP[(i - 1) & 1][j][0] * (n / (1LL << j) - i + 1) +
          DP[(i - 1) & 1][j + 1][0] * 1LL *
              (n / Solve(j, 2) - n / Solve(j + 1, 2)) +
          DP[(i - 1) & 1][j][1] * 1LL * (n / Solve(j, 2) - n / Solve(j, 0));
      DP[i & 1][j][1] = DP[(i - 1) & 1][j][1] * (n / ((1LL << j) * 3) - i + 1) +
                        DP[(i - 1) & 1][j + 1][1] * 1LL *
                            (n / Solve(j, 0) - n / Solve(j + 1, 0));
      DP[i & 1][j][0] %= MOD, DP[i & 1][j][1] %= MOD;
    }
  }
  Write(DP[n & 1][0][0]), putchar('\n');
  return 0;
}
