#include <stdio.h>
#include <bits/stdc++.h>

using namespace std;

bool _u;

using ll = long long;
using db = double;
using pii = pair <int, int> ;
using vi = vector <int> ;
#define ci const int
template <class T>
inline void chmax(T &x, const T &y) { if(x < y) x = y; }
template <class T>
inline void chmin(T &x, const T &y) { if(x > y) x = y; }
#define mp make_pair
#define fi first
#define se second
#define pc putchar
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define ppc __builtin_popcount
#define ctz __builtin_ctz
#define all(a) a.begin(), a.end()
#define clr(a, n) memset(a, 0, sizeof(a[0]) * (n + 1))
#define rep(i, l, r) for(int i = l, i##end = r; i <= i##end; ++ i)
#define per(i, r, l) for(int i = r, i##end = l; i >= i##end; -- i)
#define fsub(T, S) for(int T = S, T##_f = T; T; T = (T - 1) & T##_f)
#define fsubm(T, S) for(int T = S, T##_f = T; T; T = (T - 1) & T##_f) if(T & (T##_f & -T##_f))
#define Sin(S, i) ((S) >> (i) & 1)

char inputbuf[1 << 23], *p1 = inputbuf, *p2 = inputbuf;
//#define getchar() (p1 == p2 && (p2 = (p1 = inputbuf) + fread(inputbuf, 1, 1 << 23, stdin), p1 == p2) ? EOF : *p1++)
inline int read() {
	int res = 0; char ch = getchar(); bool f = true;
	for(; ch < '0' || ch > '9'; ch = getchar())
		f &= ch != '-';
	for(; ch >= '0' && ch <= '9'; ch = getchar())
		res = res * 10 + (ch ^ 48);
	return f ? res : -res;
}

const int N = 1e7 + 15, P = 1e9 + 7;

ll fac[N], ifac[N], pk[N];
int pr[N], pcnt;
int n, m;
bool npr[N];

ll poww(ll x, ll y = P - 2) {
	ll res = 1;
	for(; y; y >>= 1, x = x * x % P)
		if(y & 1) res = res * x % P;
	return res;
}

bool _v;

void init(int n) {
	fac[0] = 1;
	rep(i, 1, n) fac[i] = fac[i - 1] * i % P;
	ifac[n] = poww(fac[n]);
	per(i, n, 1) ifac[i - 1] = ifac[i] * i % P;
}

void prime(int n, int k) {
	npr[1] = 1;
	pk[1] = 1;
	rep(i, 2, n) {
		if(!npr[i]) pr[++ pcnt] = i, pk[i] = poww(i, k);
		for(int j = 1; j <= pcnt && pr[j] * i <= n; ++ j) {
			npr[pr[j] * i] = 1;
			pk[pr[j] * i] = pk[pr[j]] * pk[i] % P;
			if(i % pr[j] == 0) break;
		}
	}
}

signed main() {
	//clock_t _st = clock();
	//cerr << abs(&_u - &_v) / 1048576.0 << " MB" << endl;
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);
	scanf("%d", &n);
	m = n * 2;
	init(m);
	prime(n, m + 1);
	ll ans = 0, tmp;
	rep(i, 0, n - 1) {
		tmp = ifac[i] * ifac[m - i] % P * pk[n - i] % P;
		ans += i & 1 ? P - tmp : tmp;
	}
	ans = ans % P * poww(m + 1) * 2 % P;
	printf("%lld\n", ans);
	//cerr << (clock() - _st) * 1.0 / CLOCKS_PER_SEC << " s" << endl;
	return 0;
}