#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
const int N = 1000010;

int fact[N];

int n;
int fres = 1;

inline int fastpower(int num,int po){
    fres = 1;
    while(po > 0){
        if(po & 1)
            fres = (long long)fres * num % mod;
        po >>= 1;
        num = (long long)num * num % mod;
    }
    return fres;
}


inline int nck(int n,int k){
    if(n < k) return 0;
    if(k == 0) return 1;
    return (long long)fact[n] * fastpower((long long)fact[k] * fact[n - k] % mod , mod - 2) % mod;
}


int main(){
    fact[0] = 1;
    for(int i = 1;i < N;i++) fact[i] = (long long)i * fact[i - 1] % mod;
    scanf("%d",&n);
    int ans = 0;
    for(int i = 0 ;i < n;i++){
        if((n - i) & 1) continue;
        ans += (long long)(nck(n - i , i) * 2LL) * fact[n - i] % mod;
        if(ans >= mod) ans -= mod;
        if(i > 0){
            ans += (long long)(nck(n - i - 1 , i - 1) * 2LL) * fact[n - i] % mod;
            if(ans >= mod) ans -= mod;
        }
    }
    cout << ans << endl;
    return 0;
}
