#include <bits/stdc++.h>
using namespace std;
const long long N = 105000;
const long long p = 1e9 + 7;
inline long long read() {
  long long re = 0, k = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') k = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    re = re * 10 + ch - '0';
    ch = getchar();
  }
  return re * k;
}
inline long long ksm(long long y, long long x) {
  long long sum = 1;
  while (x) {
    if (x & 1) sum = (sum * y) % p;
    y = (y * y) % p;
    x >>= 1;
  }
  return sum;
}
inline long long f(long long x) {
  long long sum = 1;
  for (register long long i = 1; i <= x; i++) sum = (sum * i) % p;
  return sum;
}
inline long long inv(long long x) { return ksm(x, p - 2); }
signed main() {
  long long n = read();
  printf(
      "%lld",
      ((f(2 * n - 1) * inv(f(n)) % p * inv(f(n - 1)) % p * 2 % p - n) % p + p) %
          p);
  return 0;
}
