#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;

const ll MOD = 1e9 + 7;

ll dp[2][1050][2];
ll solve(int n){
    int curr = 0, next = 1;
    
    memset(dp[curr], 0, sizeof(dp[curr]));
    
    int segs = 2;
    dp[curr][0][0] = 1;
    
    for(int i=2;i<=n;i++){
        memset(dp[next], 0, sizeof(dp[next]));
        
        for(int b=0;b<=segs;b++){
            int s = segs - b;
            
            for(int p=0;p<=1;p++){
                if(p > b)continue;
                
                int nb = b - p;
                int ns = segs - 2 - nb;
                
                if(ns < 0 || ns > s)continue;
                
                dp[next][b+1][1] += dp[curr][b][p];
                dp[next][b+1][1] %= MOD;
                
                dp[next][b+1-p][1] += dp[curr][b][p];
                dp[next][b+1-p][1] %= MOD;
                
                if(nb > 0){
                    dp[next][b-1][0] += (dp[curr][b][p] * nb) % MOD;
                    dp[next][b-1][0] %= MOD;
                }
                
                if(ns > 0){
                    dp[next][b][0] += (dp[curr][b][p] * ns) % MOD;
                    dp[next][b][0] %= MOD;
                }
            }
        }
        
        swap(curr, next);
        ++segs;
    }
    
    return dp[curr][0][0];
}


int main(){
    int N;
    cin >> N;
    
    cout << solve(N) << endl;
    return 0;
}