#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    ll a[n+1] = {};
    a[1] = 1;
    a[2] = 2;
    ll x = 1;
    ll y = 2;
    ll MOD = 1e9+7;
    srep(i,3,n+1){
        if(i % 2 == 1){
            a[i] = y * (ll)i % MOD;
            x = (x + a[i]) % MOD;
        }else{
            a[i] = x * (ll)i % MOD;
            y = (y + a[i]) % MOD;
        }
    }
    cout << a[n] << endl;
    return 0;
}