#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
int ka() {
int x = 0;
bool z = false;
while (1)
{
char y = getchar();
if (y == '-')
z = true;
else if ('0' <= y && y <= '9')
x = x * 10 + y - '0';
else
{
if (z)
x *= -1;
return x;
}
}
}
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// const long long mod = 1e9 + 7;
const int M = 351;
int dp[M][30][M];
int n;
namespace Cnk {
const long long mod = 1e9 + 7;
const int N = 400, maxN = N - 2;
long long fact[N], ifact[N];
long long binPowByMod(long long a, long long b) {
a %= mod;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
long long choose (long long a, long long b) {
return (((fact[a] * ifact[b]) % mod ) * ifact[a - b] ) % mod;
}
void generate() {
fact[0] = fact[1] = 1;
for(int i = 2; i < N; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
ifact[maxN] = binPowByMod(fact[maxN], mod - 2);
for(int i = maxN; i >= 1; i--) {
ifact[i - 1] = (ifact[i] * i) % mod;
}
}
long long modInverse(long long A, long long M) {
long long m0 = M;
long long y = 0, x = 1;
if (M == 1) return 0;
while (A > 1) {
long long q = A / M;
long long t = M;
M = A % M, A = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0) x += m0;
return x;
}
}
using namespace Cnk;
long long add(long long a, long long b) {
return (a + b) % mod;
}
long long mult(long long a, long long b) {
return (a * b) % mod;
}
long long sub(long long a, long long b) {
return (a - b + 2 * mod) % mod;
}
void solve_() {
cin >> n;
dp[0][0][n] = 1;
for(int i = 0; i < n; i++) {
for(int j = 0; j <= 1; j++) {
for(int k = 0; k <= n; k++) {
if(!dp[i][j][k]) continue;
for(int e = 0; e <= k; e++) {
if(e == i + 1) {
dp[i + 1][j | 1][k - e] = add(dp[i + 1][j | 1][k - e], mult(dp[i][j][k], choose(k, e)));
} else {
dp[i + 1][j][k - e] = add(dp[i + 1][j][k - e], mult(dp[i][j][k], choose(k, e)));
}
}
}
}
}
long long answ = 0;
for(int i = 1; i < 2; i++) {
answ += dp[n][i][0];
if(answ >= mod) answ -= mod;
}
cout << answ << '\n';
}
int main() {
setIO();
generate();
auto solve = [&](int test_case)-> void {
while(test_case--) {
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
