#include <bits/stdc++.h>
long long pow2(int a, int n) {
  long long t = a;
  long long res = 1;
  while (n) {
    if (n & 1) res = (res * t) % 1000000007;
    t = (t * t) % 1000000007;
    n >>= 1;
  }
  return res;
}
long long cnk(int n, int k) {
  long long result = 1;
  for (int i = 1; i <= k; ++i)
    result = (((result * (n - i + 1)) % 1000000007) * pow2(i, 1000000007 - 2)) %
             1000000007;
  return result;
}
int main() {
  int n;
  scanf("%d", &n);
  long long ans = (cnk(2 * n - 1, n - 1) * 2 - n) % 1000000007;
  if (ans < 0) ans += 1000000007;
  printf("%d", (int)ans);
  return 0;
}
