#include <bits/stdc++.h>
using namespace std;
long long int C(int n, int x, int y) {
  int den = (1 << x);
  if (y) den = den * 3;
  return n / den;
}
long long int dp[2][21][2];
int main() {
  int n;
  scanf("%d", &n);
  int x = 0;
  while ((1 << (x + 1)) <= n) x++;
  dp[n & 1][x][0] = 1;
  if ((3 << (x - 1)) <= n) dp[n & 1][x - 1][1] = 1;
  for (int p = n - 1; p >= 1; p--) {
    bool pos = p & 1;
    for (int pw2 = 0; pw2 <= x; pw2++) {
      dp[pos][pw2][0] = dp[pos ^ 1][pw2][0] * (C(n, pw2, 0) - (n - p));
      dp[pos][pw2][0] +=
          dp[pos ^ 1][pw2 + 1][0] * (C(n, pw2, 0) - C(n, pw2 + 1, 0));
      dp[pos][pw2][0] += dp[pos ^ 1][pw2][1] * (C(n, pw2, 0) - C(n, pw2, 1));
      dp[pos][pw2][0] %= 1000000007;
      dp[pos][pw2][1] = dp[pos ^ 1][pw2][1] * (C(n, pw2, 1) - (n - p));
      dp[pos][pw2][1] +=
          dp[pos ^ 1][pw2 + 1][1] * (C(n, pw2, 1) - C(n, pw2 + 1, 1));
      dp[pos][pw2][1] %= 1000000007;
    }
  }
  printf("%lld", dp[1][0][0]);
}
