#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

#define MOD 1000000007

void resize_(long long& vec, vector<int>::iterator begin_, vector<int>::iterator end_, const long long& val){
	vec = val;
	return;
}

template<class T, class U>
void resize_(vector<T>& vec, vector<int>::iterator begin_, vector<int>::iterator end_, const U& val){
	vec.resize(*begin_);
	for(int i=0; i<vec.size(); i++){
		resize_(vec[i], begin_+1, end_, val);
	}
}

template<class T, class U>
void resize_(vector<T>& vec, vector<int>&& sz, const U& val){
	resize_(vec, sz.begin(), sz.end(), val);
}


int main(){
	int n;
	cin >> n;

	if(n==1){
		cout << 1 << endl;
		return 0;
	}else if(n==2){
		cout << 2 << endl;
		return 0;
	}

	vector<vector<vector<long long>>> dp;
	resize_(dp, {n+2, 2, 2}, 0);
	dp[0][0][0] = 2;

	for(int i=2; i<n; i++){
		vector<vector<vector<long long>>> dp_;
		resize_(dp_, {n+2,2,2}, 0);

		for(int k=0; k<i; k++)
		for(int a=0; a<2; a++)
		for(int b=0; b<2; b++){
			if(a && b){
				if(k>0) dp_[k-1][b][0] += dp[k][a][b] * (k-2);
						dp_[k  ][b][1] += dp[k][a][b] * 1;
						dp_[k+1][b][1] += dp[k][a][b] * 1;
				if(k>0) dp_[k-1][0][0] += dp[k][a][b] * 1;
						dp_[k  ][b][0] += dp[k][a][b] * (i+1-1-k);

			}else if(a && !b){
				if(k>0) dp_[k-1][b][0] += dp[k][a][b] * (k-1);
						dp_[k  ][b][1] += dp[k][a][b] * 1;
						dp_[k+1][b][1] += dp[k][a][b] * 1;
						dp_[k  ][b][0] += dp[k][a][b] * (i+1-1-k);

			}else if(!a && b){
				if(k>0) dp_[k-1][b][0] += dp[k][a][b] * (k-1);
						dp_[k+1][b][1] += dp[k][a][b] * 2;
				if(k>0) dp_[k-1][0][0] += dp[k][a][b] * 1;
						dp_[k  ][b][0] += dp[k][a][b] * (i+1-2-k);

			}else if(!a && !b){
				if(k>0) dp_[k-1][b][0] += dp[k][a][b] * k;
						dp_[k+1][b][1] += dp[k][a][b] * 2;
						dp_[k  ][b][0] += dp[k][a][b] * (i+1-2-k);
			}
		}

		for(int k=0; k<=i; k++)
		for(int a=0; a<2; a++)
		for(int b=0; b<2; b++){
			dp_[k][a][b] %= MOD;
		}
		swap(dp, dp_);
	}

	cout << dp[0][0][0] << endl;
	return 0;
}