/* -*- coding: utf-8 -*-
 *
 * 554.cc: No.554 recurrence formula - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

typedef long long ll;
const ll MOD = 1000000007;

/* typedef */

/* global variables */

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;

  ll an = 1, sums[2] = { 0, 1 };
  for (int i = 2; i <= n; i++) {
    int p = (i & 1);
    an = sums[p ^ 1] * i % MOD;
    sums[p] = (sums[p] + an) % MOD;
  }

  printf("%lld\n", an);
  return 0;
}