#include <bits/stdc++.h>
using namespace std;
bool isprime(long long n) {
  if (n < 2) return 0;
  if (n == 2) return 1;
  if (n % 2 == 0) return 0;
  for (long long i = 3; i * i <= n; i++)
    if (n % i == 0) return 0;
  return 1;
}
long long count(long long n, long long p) {
  long long tot = 0, d = p;
  while (d <= n) tot += n / d, d *= p;
  return tot;
}
long long power(long long x, long long y, long long mod) {
  if (y == 0) return 1;
  if (y % 2) {
    return (power(x, y - 1, mod) * x) % mod;
  } else {
    long long r = power(x, y / 2, mod);
    return (r * r) % mod;
  }
}
int main(void) {
  long long n;
  long long res = 1;
  long long mod = 1000000007;
  cin >> n;
  for (long long i = 1; i < n * 2; ++i)
    if (isprime(i)) {
      long long p = count(2 * n - 1, i) - count(n, i) - count(n - 1, i);
      res = (res * power(i, p, mod)) % mod;
    }
  cout << (res * 2 + mod - n) % mod << endl;
  return 0;
}
