#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e3 + 5;
const int mod = 1e9 + 7;
int n, dp[N][N][2][2];

signed main() {
    ios_base :: sync_with_stdio(NULL);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin >> n;

    if(n == 1) return cout << 1, 0;

    dp[1][0][0][0] = dp[2][0][0][0] = 2;

    for(int i = 3 ; i <= n ; ++ i)
        for(int j = 0 ; j <= n ; ++ j)
            for(int k = 0 ; k <= 1 ; ++ k)
                for(int l = 0 ; l <= 1 ; ++ l) {
                    if(j) {
                        if(k) dp[i][j - 1][0][0] = (dp[i][j - 1][0][0] + dp[i - 1][j][k][l]) % mod;

                        dp[i][j - 1][0][l] = (dp[i][j - 1][0][l] + dp[i - 1][j][k][l] * (j - k - l) % mod) % mod;
                    }

                    if(l) dp[i][j][1][k] = (dp[i][j][1][k] + dp[i - 1][j][k][l]) % mod;

                    dp[i][j][0][k] = (dp[i][j][0][k] + dp[i - 1][j][k][l] * (i - j - 2 + l)) % mod;
                    dp[i][j + 1][1][k] = (dp[i][j + 1][1][k] + dp[i - 1][j][k][l] * (2 - l)) % mod;
                }

    cout << dp[n][0][0][0];

    return 0;
}