#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
const int N=1010;
int n,fac[N];
signed main(){
    ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
    fac[0]=1;
    for(int i=1;i<N;++i)fac[i]=fac[i-1]*i%mod;
    cin>>n;
    int ans=0;
    for(int i=0;i<=n;++i){
        int F=(n-i+1)*max(0ll,n-2*i+2)%mod*fac[n-i]%mod;
        if(!i)F=fac[n];
        if(i&1)ans=(ans-F+mod)%mod;
        else ans=(ans+F)%mod;
    }
    cout<<ans;
    return 0;
}