#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAXN = 1003;
const ll MOD = 1e9+7;
ll dp[MAXN][MAXN][2][2]; // n, ng, (n-3,n-1), (n-2, n) -> num

inline void add(ll& a, ll b) {
    (a += b) %= MOD;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    if (N <= 2) {
        cout << N << endl;
        return 0;
    }
    dp[2][0][0][0] = 2;
    for (int n = 2; n < N; n++) for (int ng = 0; ng < n; ng++) {
        // (n-3, n-1) (n-2, n)
        ll v = dp[n][ng][1][1];
        if (v) {
            // split n-2, n
            add(dp[n+1][ng-1][0][0], v);
            // split n-3, n-1
            add(dp[n+1][ng][1][1], v);
            // adjacent to n-1
            add(dp[n+1][ng+1][1][1], v);
            // split others
            add(dp[n+1][ng-1][1][0], v*(ng-2));
            // others
            add(dp[n+1][ng][1][0], v*((n+1)-(ng+1)));
        }
        // (n-3, n-1)
        v = dp[n][ng][1][0];
        if (v) {
            // split n-3, n-1
            add(dp[n+1][ng][0][1], v);
            // adjacent to n-1
            add(dp[n+1][ng+1][0][1], v);
            // split others
            add(dp[n+1][ng-1][0][0], v*(ng-1));
            // others
            add(dp[n+1][ng][0][0], v*((n+1)-(ng+1)));
        }
        // (n-2, n)
        v = dp[n][ng][0][1];
        if (v) {
            // split n-2, n
            add(dp[n+1][ng-1][0][0], v);
            // adjacent to n-1
            add(dp[n+1][ng+1][1][1], 2*v);
            // split others
            add(dp[n+1][ng-1][1][0], v*(ng-1));
            // others
            add(dp[n+1][ng][1][0], v*((n+1)-(ng+2)));
        }
        // none
        v = dp[n][ng][0][0];
        if (v) {
            // adjacent to n-1
            add(dp[n+1][ng+1][0][1], 2*v);
            // split
            if (ng > 0) add(dp[n+1][ng-1][0][0], v*ng);
            // others
            add(dp[n+1][ng][0][0], v*((n+1)-(ng+2)));
        }
    }
    cout << dp[N][0][0][0] << endl;
    return 0;
}