#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define var auto
#define mod 1000000007
#define inf 2147483647
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;

template <typename T>
inline void output(T a, int p) {
    if(p){
        cout << fixed << setprecision(p)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}
// end of template
ll pow_mod(ll a, ll b, ll m){
    
    ll ret = 1;
    while (b > 0) {
        if (b & 1) {
            ret = ret * a % m;
        }
        a = a * a % m;
        b >>= 1;
    }
    
    return ret;
}

ll inv_mod(ll a, ll m){
    return pow_mod(a, m - 2, m);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    int N;
    cin >> N;
    if (N <= 2) {
        output(0, 0);
        return 0;
    }
    
    vector<vector<ll>> C(N + 1, vector<ll>(N + 1, 1)); // combination
    repd(i, 1, N + 1) repd(j, 1, i) (C[i][j] = C[i - 1][j - 1] + C[i - 1][j]) %= mod;
    
    vector<ll> dp(N + 1, 0);
    dp[1] = 1, dp[2] = 2, dp[3] = 4;
    
    ll inv2 = inv_mod(2, mod);
    ll inv4 = inv_mod(4, mod);
    
    repd(i, 4, N + 1){
        rep(j, i){
            ll tmp = 0;
            if (j == 0 || j == i - 1) {
                tmp = dp[i - 1];
                (tmp *= inv2) %= mod;
            }
            else if (j == 1 || j == i - 2){
                tmp = dp[i - 2];
                (tmp *= i - 1) %= mod;
                (tmp *= inv2) %= mod;
            }
            else{
                tmp = dp[i - 1 - j];
                (tmp *= dp[j]) %= mod;
                (tmp *= C[i - 1][j]) %= mod;
                (tmp *= inv4) %= mod;
            }
            (dp[i] += tmp) %= mod;
        }
    }
    
    output(dp[N], 0);
    
    return 0;
}