#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
LL MOD=1e9+7;
int n;
LL a[100001];
LL odd=1;
LL even=0;
/*LL f(int n){
   if(a[n]!=-1)return a[n];
   if(n==0)return 0;
   if(n==1)return 1;
   LL ans=0;
   if(n%2==0){
      for(int i=0;i*2+1<n;i++){
          ans+=
      }
   }else{
   }
   a[i]=n*ans;
   return a[i];
}*/
int main(){
    cin>>n;
    for(int i=2;i<n+1;i++){
        if(i%2==0){
           a[i]=(odd*i)%MOD;
           even=(even+a[i])%MOD;
        }else{
           a[i]=(even*i%MOD);
           odd=(odd+a[i])%MOD;
        }
    }
    cout<<a[n]<<endl;
	return(0);
}