#include <bits/stdc++.h>
using namespace std;
template <typename P, typename Q>
P CeilDiv(P _dividend, Q _divider) {
  return static_cast<P>((_dividend - 1LL + _divider) / _divider);
}
template <typename Tp>
inline void outarr(Tp _begin, Tp _end, const char* _delim = " ") {
  for (Tp current = _begin; current != _end; ++current) {
    std::cout << *current << _delim;
  }
  std::cout << '\n';
}
using ll = long long;
using pii = std::pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr int MOD = static_cast<const int>(1e9 + 7);
int Add(int x, int y) {
  x += y;
  return x < MOD ? x : x - MOD;
}
int Sub(int x, int y) {
  x -= y;
  return x >= 0 ? x : x + MOD;
}
int Mul(int x, int y) { return int(1LL * x * y % MOD); }
int FastPow(int x, int p) {
  int res = 1;
  while (p > 0) {
    if (p & 1) {
      res = Mul(res, x);
    }
    p >>= 1;
    x = Mul(x, x);
  }
  return res;
}
int Inv(int x) { return FastPow(x, MOD - 2); }
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int n;
  cin >> n;
  int ans = 1;
  for (int i = 0; i < (n); ++i) {
    ans = Mul(ans, i + 1);
  }
  ans = Sub(ans, FastPow(2, n - 1));
  cout << ans << "\n";
  return 0;
}
