#include <bits/stdc++.h>
using namespace std;
long long ans = 1, n;
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 c(long long n, long long k) {
  long long res = 0, p = k;
  while (p <= n) {
    res += n / p;
    p *= k;
  }
  return res;
}
long long power(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2 == 0) {
    long long r = power(a, b / 2);
    return (r * r) % 1000000007;
  } else
    return (power(a, b - 1) * a) % 1000000007;
}
int main() {
  scanf("%d", &n);
  for (long long i = 2; i < 2 * n; i++) {
    if (isprime(i))
      ans = (ans * power(i, c(2 * n - 1, i) - c(n, i) - c(n - 1, i))) %
            1000000007;
  }
  ans = (2 * ans + 1000000007 - n) % 1000000007;
  printf("%d\n", ans);
  return 0;
}
