#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

const ll mod = 1e9 + 7;

int main(){
    ll n;
    cin >> n;
    VL dp(n+1);
    dp[1] = 1;
    ll odd = 1, even = 0;
    FOR(i,2,n){
        if (i % 2 == 0){
            dp[i] = (i * odd) % mod;
            even = (even + dp[i]) % mod;
        }else{
            dp[i] = (i * even) % mod;
            odd = (odd + dp[i]) % mod;
        }
    }
    cout << dp[n] << endl;
    return 0;
}