#include <bits/stdc++.h>
int main() {
  long long int n;
  scanf("%lld", &n);
  n++;
  long long int demonimator = 1;
  for (long long int i = 2; i <= n; i++)
    demonimator = demonimator * i % 1000000007;
  long long int numerator = n + 1;
  for (long long int i = n + 2; i <= 2 * n; i++)
    numerator = numerator * i % 1000000007;
  long long int p1, p2;
  std::function<void(long long int, long long int, long long int, long long int,
                     long long int, long long int)>
      gcd = [&](long long int a, long long int ma, long long int na,
                long long int b, long long int mb, long long int nb) {
        if (b != 0) {
          long long int q = a / b;
          long long int c = a % b;
          long long int mc = ma - q * mb;
          long long int nc = na - q * nb;
          gcd(b, mb, nb, c, mc, nc);
        } else {
          p1 = ma;
          p2 = na;
        }
      };
  gcd(1000000007, 1, 0, demonimator, 0, 1);
  long long int inverse = p2 % 1000000007;
  if (inverse < 0) inverse += 1000000007;
  printf("%lld\n", (numerator * inverse + 1000000007 - 1) % 1000000007);
  return 0;
}
