#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1010000, MOD = 1000000007;
long long f[MAXN * 2], ans;
long long inv(long long a, long long m) {
  long long p = 1, q = 0, b = m, c, d;
  while (b > 0) {
    c = a / b;
    d = a;
    a = b;
    b = d % b;
    d = p;
    p = q;
    q = d - c * q;
  }
  return p < 0 ? p + m : p;
}
int main() {
  int n;
  long long last;
  cin >> n;
  f[0] = 1;
  ans = 1;
  last = 0;
  for (int i = 1; i <= 2 * n; i++) {
    f[i] = (2 * f[i - 1] - 2 * last + 2 * MOD) % MOD;
    ans += f[i];
    ans %= MOD;
    if (i == n)
      last = 1;
    else if (i > n)
      last = last * i % MOD * inv(i - n, MOD) % MOD;
  }
  cout << ans % MOD << endl;
  return 0;
}
