#include <bits/stdc++.h>
using namespace std;
int n;
int dp[2][21][2], maxi, p2[21];
int val(int a, int b) {
  int v = 1;
  if (b == 1) v = 3;
  return (n / (p2[a] * v));
}
int main() {
  int i, j, k;
  ios::sync_with_stdio(false);
  cin >> n;
  p2[0] = 1;
  for (i = 1; i <= 20; i++) p2[i] = (p2[i - 1] * 2) % 1000000007;
  maxi = p2[0];
  i = 0;
  while ((i < 20) && (p2[i + 1] <= n)) i++;
  maxi = i;
  dp[1][maxi][0] = 1;
  if (3LL * p2[(maxi - 1)] <= n) dp[1][maxi - 1][1] = 1;
  for (i = 2; i <= n; i++)
    for (j = 0; j <= maxi; j++) {
      dp[i % 2][j][0] = 0;
      dp[i % 2][j][1] = 0;
      for (k = 0; k <= 1; k++) {
        dp[i % 2][j][k] +=
            ((1LL * val(j, k) - (i - 1)) * dp[1 - i % 2][j][k]) % 1000000007;
        dp[i % 2][j][k] %= 1000000007;
        if (j > 0)
          dp[i % 2][j - 1][k] +=
              ((1LL * val(j - 1, k) - val(j, k)) * (dp[1 - i % 2][j][k])) %
              1000000007;
        dp[i % 2][j - 1][k] %= 1000000007;
        if (k > 0)
          dp[i % 2][j][k - 1] +=
              ((1LL * val(j, k - 1) - val(j, k)) * (dp[1 - i % 2][j][k])) %
              1000000007;
        dp[i % 2][j][k - 1] %= 1000000007;
      }
    }
  cout << dp[n % 2][0][0];
  return 0;
}
