#include <bits/stdc++.h>
long long n, now, ans, fac1, fac2;
const long long P = 1e9 + 7;
long long pow(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x % P;
    x = x * x % P;
    y >>= 1;
  }
  return res;
}
int main() {
  scanf("%lld", &n);
  now = 1;
  for (int i = 2; i <= n; i++) now = now * i % P;
  fac1 = now;
  now = 1;
  for (int i = n; i <= n * 2 - 1; i++) now = now * i % P;
  fac2 = now;
  ans = fac2 * pow(fac1, P - 2) % P;
  ans = ans * 2 % P;
  ans = (ans - n) % P;
  printf("%lld", ans);
  return 0;
}
