#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mo=1e9+7;
int n,f[2001][2001][2][2];
signed main(){
    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++){
            for(int k=0;k<=1;k++){
                for(int l=0;l<=1;l++){
                    if(j==0&&(l==1||k==1)) continue;
                    if(k==1){
                        f[i+1][j][l][0]+=f[i][j][k][l]*(i+1-j-1);//???
                        f[i+1][j][l][0]%=mo;
                        f[i+1][j][l][1]+=f[i][j][k][l];//??-1?i-3??
                        f[i+1][j][l][1]%=mo;
                        f[i+1][j+1][l][1]+=f[i][j][k][l];//?i-1??
                        f[i+1][j+1][l][1]%=mo;
                        if(l==1){
                            f[i+1][j-1][l][0]+=f[i][j][k][l]*(j-2);
                            f[i+1][j-1][l][0]%=mo;
                            f[i+1][j-1][0][0]+=f[i][j][k][l];
                            f[i+1][j-1][0][0]%=mo;
                        }
                        else {
                            f[i+1][j-1][l][0]+=f[i][j][k][l]*(j-1);//?|p_x-p_x-1|=2??(???i-1?i-3)
                            f[i+1][j-1][l][0]%=mo;
                        }
                    }
                    else{
                        f[i+1][j][l][0]+=f[i][j][k][l]*(i+1-j-2);//???
                        f[i+1][j][l][0]%=mo;
                        f[i+1][j+1][l][1]+=f[i][j][k][l]*2;//?i-1??
                        f[i+1][j+1][l][1]%=mo;
                        if(j!=0)
                        if(l==1){
                            f[i+1][j-1][0][0]+=f[i][j][k][l];
                            f[i+1][j-1][0][0]%=mo;
                            f[i+1][j-1][l][0]+=f[i][j][k][l]*(j-1);
                            f[i+1][j-1][l][0]%=mo;
                        }
                        else {
                            f[i+1][j-1][l][0]+=f[i][j][k][l]*j;//?|p_x-p_x-1|=2??
                            f[i+1][j-1][l][0]%=mo;
                        }
                    }
                    //cout<<f[i][j][k][l]<<" ";
                }
            }
            //cout<<endl;
        }
        //cout<<endl;
    }
    cout<<f[n][0][0][0]<<endl;
    return 0;
}