#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1010;
const int M = 1e9+7;
int a[N][N];
int main(){
for(int i = 0 ; i < N ; i++){
for(int j = 0 ; j <= i ; j++){
if(!j)a[i][j] = 1;
else{
a[i][j] = (a[i-1][j] + a[i-1][j-1])%M;
}
}
}
int n;
int sum = 0;
cin >> n;
for(int i = 2 ; i < n-1 ; i++)
sum = (sum + (ll)a[n-1][i]*(i-1)*(n-i-1))%M;
cout << sum << endl;
}