// includes #include using namespace std; // macros #define pb emplace_back #define mk make_pair #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define bit(n) (1LL<<(n)) // functions template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template istream &operator>>(istream &is, vector &vec){for(auto &v: vec)is >> v; return is;} template ostream &operator<<(ostream &os, const vector& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template ostream &operator<<(ostream &os, const set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const pair &p){os << p.first << " " << p.second; return os;} template ostream &operator<<(ostream &os, const map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template ostream &operator<<(ostream &os, const unordered_map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} // types using ll = long long int; using P = pair; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1000000007; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; // io struct fast_io{ fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);} } fast_io_; ll dp[1010][1010][2][2]; int main(int argc, char const* argv[]) { int n; cin >> n; dp[0][0][0][0] = 1; rep(i, n){ rep(j, i + 1){ // k = 0, l = 0 if(j > 0)(dp[i+1][j-1][0][0] += j * dp[i][j][0][0] % mod) %= mod; if(i > 1){ (dp[i+1][j+1][0][1] += 2 * dp[i][j][0][0] % mod) %= mod; if(i-1-j>=0)(dp[i+1][j][0][0] += (i-1-j) * dp[i][j][0][0] % mod) %= mod; }else{ (dp[i+1][j][0][0] += (i+1-j) * dp[i][j][0][0] % mod) %= mod; } // k = 0, l = 1 if(j > 0){ (dp[i+1][j-1][1][0] += (j - 1) * dp[i][j][0][1] % mod) %= mod; (dp[i+1][j-1][0][0] += dp[i][j][0][1]) %= mod; } (dp[i+1][j+1][1][1] += 2 * dp[i][j][0][1] % mod) %= mod; if(i-1-j>=0)(dp[i+1][j][1][0] += (i-1-j) * dp[i][j][0][1] % mod) %= mod; // k = 1, l = 0 (dp[i+1][j][0][1] += dp[i][j][1][0]) %= mod; if(j > 0)(dp[i+1][j-1][0][0] += (j - 1) * dp[i][j][1][0] % mod) % mod; (dp[i+1][j+1][0][1] += dp[i][j][1][0]) %= mod; (dp[i+1][j][0][0] += (i-j) * dp[i][j][1][0] % mod) %= mod; // k = 1, l = 1 (dp[i+1][j][1][1] += dp[i][j][1][1]) %= mod; if(j > 0){ (dp[i+1][j-1][0][0] += dp[i][j][1][1]) %= mod; if(j > 1)(dp[i+1][j-1][1][0] += (j - 2) * dp[i][j][1][1]) %= mod; } (dp[i+1][j+1][1][1] += dp[i][j][1][1]) %= mod; (dp[i+1][j][1][0] += (i-j) * dp[i][j][1][1]) %= mod; } } cout << dp[n][0][0][0] << endl; return 0; }