#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int P = 1e9 + 7;

const int N = 1e7 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int inc(int a, int b) { return (a += b) >= P ? a - P : a; }
int dec(int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul(int a, int b) { return 1ll * a * b % P; }
int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; }

int fac[N], inv[N], finv[N];
void init(int w) {
  fac[0] = inv[1] = finv[0] = 1;
  rep(i, 1, w) fac[i] = mul(fac[i - 1], i);
  rep(i, 2, w) inv[i] = P - mul(P / i, inv[P % i]);
  rep(i, 1, w) finv[i] = mul(finv[i - 1], inv[i]);
}

int C(int a, int b) {
  if (a < b || b < 0) return 0;
  return mul(fac[a], mul(finv[b], finv[a - b]));
}

int n, tot, p[N], a[N], pw[N], b[N], coef[N], ans;
bool tag[N];

void sieve(int w) {
  pw[1] = 1;
  rep(i, 2, w) {
    if (!tag[i]) p[++ tot] = i, pw[i] = qpow(i, 2 * n);
    for (int j = 1; j <= tot && i * p[j] <= w; ++ j) {
      tag[i * p[j]] = true, pw[i * p[j]] = mul(pw[i], pw[p[j]]);
      if (!(i % p[j])) break;
    }
  }
}

int solve(int l, int r) {
  int res = 0;
  rep(i, 0, r) {
    res = inc(res, mul(a[i], dec(b[r - i], b[max(l - i - 1, 0)])));
  }
  return res;
}

int main() {
  n = read(), init(2 * n + 1), sieve(2 * n + 1);
  rep(i, 0, 2 * n) {
    int t = mul(finv[i], finv[2 * n - i]);
    i & 1 ? a[i] = P - t : a[i] = t;
  }
  rep(i, 1, 2 * n) b[i] = inc(b[i - 1], pw[i]);
  rep(i, 1, 2 * n) {
    int t = mul(mul(2 * n, i), inv[2 * n + 1]);
    i <= n ? t = dec(n, t) : t = dec(t, n);
    coef[i] = inc(coef[i], t), coef[i - 1] = dec(coef[i - 1], t);
  }
  for (int l = 1, r; l <= 2 * n; l = r + 1) {
    for (r = l; r < 2 * n && coef[r + 1] == coef[l]; ++ r) ;
    ans = inc(ans, mul(coef[l], solve(l, r)));
  }
  printf("%d\n", ans);
  return 0;
}