#include <bits/stdc++.h>
#define MOD 1000000007

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

template<int mod>
struct ModInt{
    int x;
    ModInt():x(0){}
    ModInt(long long y):x(y>=0?y%mod:(mod-(-y)%mod)%mod){}
    ModInt &operator+=(const ModInt &p){
        if((x+=p.x)>=mod)x-=mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p){
        if((x+=mod-p.x)>=mod)x-=mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p){
        x=(int)(1LL*x*p.x%mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p){
        *this*=p.inverse();
        return *this;
    }
	ModInt &operator^=(long long p){
		ModInt res = 1;
		for (; p; p >>= 1) {
			if (p & 1) res *= *this;
			*this *= *this;
		}
		return *this = res;
	}
    ModInt operator-()const{return ModInt(-x);}
    ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
    ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
    ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
    ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
	ModInt operator^(long long p)const{return ModInt(*this)^=p;}
    bool operator==(const ModInt &p)const{return x==p.x;}
    bool operator!=(const ModInt &p)const{return x!=p.x;}
    explicit operator int() const { return x; }                           // added by QCFium
    ModInt operator=(const int p) {x = p; return ModInt(*this);} // added by QCFium
    ModInt inverse()const{
        int a=x,b=mod,u=1,v=0,t;
        while(b>0){
            t=a/b;
            a-=t*b;
            std::swap(a,b);
            u-=t*v;
            std::swap(u,v);
        }
        return ModInt(u);
    }
    friend std::ostream &operator<<(std::ostream &os,const ModInt<mod> &p){
        return os<<p.x;
    }
    friend std::istream &operator>>(std::istream &is,ModInt<mod> &a){
        long long x;
        is>>x;
        a=ModInt<mod>(x);
        return (is);
    }
};
typedef ModInt<MOD> mint;

struct MComb {
    std::vector<mint> fact;
    std::vector<mint> inversed;
    MComb(int n) { // O(n+log(mod))
        fact = std::vector<mint>(n+1,1);
        for (int i = 1; i <= n; i++) fact[i] = fact[i-1]*mint(i);
        inversed = std::vector<mint>(n+1);
        inversed[n] = fact[n] ^ (MOD-2);
        for (int i = n - 1; i >= 0; i--) inversed[i]=inversed[i+1]*mint(i+1);
    }
    mint ncr(int n, int r) {
        return (fact[n] * inversed[r] * inversed[n-r]);
    }
    mint npr(int n, int r) {
        return (fact[n] * inversed[n-r]);
    }
    mint nhr(int n, int r) {
        assert(n+r-1 < (int)fact.size());
        return ncr(n+r-1, r);
    }
};

mint solve(int n) {
	int a[n - 1];
	for (int i = 0; i + 1 < n; i++) a[i] = i;
	mint res = 0;
	int res_cnt[n + 1];
	memset(res_cnt, 0, sizeof(res_cnt));
	do {
		bool b[n];
		memset(b, 0, sizeof(b));
		int cnt = 0;
		for (int i = 0; i + 1 < n; i++) {
			if (!b[a[i]]) b[a[i]] = true, cnt++;
			if (!b[a[i] + 1]) b[a[i] + 1] = true, cnt++;
			if (cnt == n) {
				res += i + 1;
				res_cnt[i + 1]++;
				break;
			}
		}
	} while (std::next_permutation(a, a + n - 1));
	for (int i = 0; i <= n; i++) std::cerr << i << ":" << res_cnt[i] << std::endl;
	return res;
}


int main() {
	int n = ri();
	if (n == 2) {
		std::cout << 1 << std::endl;
		return 0;
	}
	MComb com(n + 1);
	mint lower[n + 1];
	for (int i = 2; i < n; i++) {
		mint res = 0;
		int usable = i - 2;
		int size = n - 3; // ume
		assert(usable <= size);
		if (usable * 2 >= size) {
			// std::cerr << i << ":" << usable << ":" << size - usable << std::endl;
			res += com.fact[i] * com.fact[n - i - 1] * com.ncr(usable, size - usable);
		}
		size--;
		if (usable * 2 >= size && usable <= size) {
			// std::cerr << i << ":" << usable << ":" << size - usable << std::endl;
			res += com.fact[i] * com.fact[n - i - 1] * com.ncr(usable, size - usable);
		}
		lower[i] = res;
	}
	for (int i = n - 1; i; i--) {
		lower[i] -= lower[i - 1];
	}
	mint res = 0;
	for (int i = 2; i < n; i++) {
		res += lower[i] * i;
	}
	// for (int i = 0; i <= n; i++) std::cout << i << ":" << lower[i] << std::endl;
	std::cout << res << std::endl;
	// std::cout << solve(n) << std::endl;
	return 0;
}



Measured memory_bytes: 11904