#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 3e18;
double Pi = 3.1415926535897932384626;

vector<ll> G[500005];
vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pd(x) cerr<<"//"<<(x)<<endl;
#define re(i,n) for(i=0;i<n;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl


ll mod = 1000000007;
ll rui(ll number1,ll number2){
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

ll n,m,num,sum,ans,a,b,c,d,e,g,h,i,j,k,ok,ng,l,q;
ll x[500005],y[500005],z[500005],w[500005];
ll banb[5005][5005],banw[5005][5005];
char s[500005],t[500005];
bool flag,dame;

ll  fact[1200000];
ll rfact[1200000];

ll mpow(ll x, ll y, ll m) {
    x %= m;
    ll result = 1;
    while (y > 0) {
        if (y & 1) result = (result * x) % m;
        x = (x * x) % m;
        y >>= 1;
    }
    return result;
}
unsigned long long int minverse(unsigned long long int x, unsigned long long int m) {
    return mpow(x, m-2, m);
}
void c3_init(ll m){
    fact[0]  = rfact[0] = 1;
    for(ll xxxx=1; xxxx<1200000; xxxx++){
        fact[xxxx] = (fact[xxxx-1]*xxxx)%m;
        rfact[xxxx] = minverse(fact[xxxx],m);
    }
}
ll c3(ll n, ll abc, ll m){
    return (((fact[n] * rfact[abc])%m) * rfact[n-abc])%m;
}
 
int main(){
    cin >> n;
	c3_init(mod);
	for(i=1;i<=n-1;i++){
		//length is i
		if(1 + (i - 1) * 2 < n - 1)continue;
		//pe(i);
		ll one,two;
		two = n - 1 - i;
		one = i - 1 - two;
		ans += ((((((c3(one+two,one,mod) * fact[i])%mod) * fact[n-1-i]) % mod + (mod - sum))%mod) * i)%mod ;
		//ans += ((c3(one+two,one,mod) * (fact[i] * fact[n-1-i]) % mod + mod - sum)%mod * i)%mod;
		ans %= mod;
		//p(ans);
		
		sum += (((((c3(one+two,one,mod) * fact[i])%mod) * fact[n-1-i]) % mod + (mod - sum))%mod);
		//sum += (c3(one+two,one,mod) * (fact[i] * fact[n-1-i])%mod)%mod;
		sum %= mod;
		assert(ans >= 0);
		assert(sum >= 0);
	}
	p(ans);

	return 0;
}

Measured memory_bytes: 44928