#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1 << (x))
#define popcount __builtin_popcountll
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long l, long long r) {
return l + rd() % (r - l + 1);
}
const int N = 750 + 5;
const int mod = 1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int inf = 1e9; // INT_MAX;
const long long llinf = 1e18; // LLONG_MAX;
template<class X, class Y>
bool minimize(X &a, Y b) {
return a > b ? (a = b, true) : false;
}
template<class X, class Y>
bool maximize(X &a, Y b) {
return a < b ? (a = b, true) : false;
}
template<class X, class Y>
bool add(X &a, Y b) {
a += b;
while (a >= mod) a -= mod;
while (a < 0) a += mod;
return true;
}
int MUL(int x, int y) {
return 1LL * x * y % mod;
}
int n;
int c[N][N], f[N][N], g[N][N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
c[0][0] = 1;
for (int i = 1; i <= 750; ++i)
for (int j = 0; j <= i; ++j) {
if (j == 0 || j == i) c[j][i] = 1;
else {
add(c[j][i], c[j - 1][i - 1]);
add(c[j][i], c[j][i - 1]);
}
}
cin >> n;
f[0][0] = g[0][0] = 1;
for (int i = 1; i <= n; ++i)
for (int j = 0; j <= n; ++j)
for (int k = 0; j - k >= 0; ++k) {
add(f[i][j], MUL(f[i - 1][j - k], c[k][j]));
}
for (int i = 1; i <= n; ++i)
for (int j = 0; j <= n; ++j)
for (int k = 0; j - k >= 0; ++k) {
if (k != i) add(g[i][j], MUL(g[i - 1][j - k], c[k][j]));
}
int res = f[n][n];
add(res, -g[n][n]);
cout << res;
return 0;
}
/*
*/
