#include<cstdio>
#include<array>
using namespace std;
constexpr int MOD = 1e9 + 7;
int read(int x = 0) { return scanf("%d", &x), x; }

int pow(int n, int k, int ret = 1) {
	for (int mul = n; k; k >>= 1) {
		if (k & 1) ret = ret *1L* mul % MOD;
		mul = mul *1L* mul % MOD;
	}
	return ret;
}

auto&& binomial = [](){
	array<array<int, 52>, 52> d {{1}};
	for (int i = 1; i <= 51; i++) {
		d[i][0] = 1;
		for (int j = 1; j <= i; j++)
			d[i][j] = (d[i-1][j] + d[i-1][j-1]) % MOD;
	}
	return d;
}();

int n = read();

int f(int k, auto& d) {
	if (k == 0) return n;
	if (d[k]) return d[k];

	int ans = (pow(n+1, ++k) - 1 + MOD) % MOD;
	for (int i = 2; i <= k; i++) {
		ans = ((ans - binomial[k][i] *1L* f(k-i, d) % MOD) % MOD + MOD) % MOD;
	}

	return d[k-1] = ans *1L* pow(k, MOD-2) % MOD;
}

int main() {
	int d[52] {};
	return printf("%d\n", f(read(), d)), 0;
}