#include<bits/stdc++.h>
using namespace std; 
#define int long long
const int mod = 1e9 + 7;
int n,f[1010][1010][2][2];
signed main(){
    // freopen("a.in","r",stdin);
    // freopen("a.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n;
    f[1][0][0][0] = 1,f[2][0][0][0] = 2;
    for(int i = 2;i < n;i++)
        for(int j = 0;j < i;j++){
            if(j > 0){
                f[i + 1][j - 1][0][0] = (f[i + 1][j - 1][0][0] + f[i][j][0][0] * j % mod + (j - 1) * f[i][j][1][0] % mod + f[i][j][1][1] + f[i][j][0][1]) % mod;
                f[i + 1][j][0][1] = (f[i + 1][j][0][1] + f[i][j][1][0]) % mod;
                f[i + 1][j - 1][1][0] = (f[i + 1][j - 1][1][0] + f[i][j][0][1] * (j - 1) % mod + f[i][j][1][1] * (j - 2) % mod) % mod;
            }
            f[i + 1][j][0][0] = (f[i + 1][j][0][0] + f[i][j][0][0] * (i - j - 1) % mod + (i - j) * f[i][j][1][0] % mod) % mod;
            f[i + 1][j + 1][0][1] = (f[i + 1][j + 1][0][1] + 2 * f[i][j][0][0] % mod + f[i][j][1][0]) % mod;
            f[i + 1][j][1][0] = (f[i + 1][j][1][0] + (i - j - 1) * f[i][j][0][1] % mod + (i - j) * f[i][j][1][1] % mod) % mod;
            f[i + 1][j + 1][1][1] = (f[i + 1][j + 1][1][1] + f[i][j][0][1] * 2 % mod + f[i][j][1][1]) % mod;
            f[i + 1][j][1][1] = (f[i + 1][j][1][1] + f[i][j][1][1]) % mod;            
        }
    cout<<f[n][0][0][0];
    return 0;
}