#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int Ksm(int x, int y) {
  int sum = 1;
  for (; y; y >>= 1) {
    if (y & 1) sum = 1LL * sum * x % mod;
    x = 1LL * x * x % mod;
  }
  return sum;
}
int n;
int main() {
  scanf("%d", &n);
  ++n;
  int tmp1 = 1;
  for (int i = 1; i <= 2 * n - 1; i++) tmp1 = 1LL * tmp1 * i % mod;
  int tmp2 = 1;
  for (int i = 1; i <= n; i++) tmp2 = 1LL * tmp2 * i % mod;
  for (int i = 1; i < n; i++) tmp2 = 1LL * tmp2 * i % mod;
  tmp2 = Ksm(tmp2, mod - 2);
  printf("%I64d\n", (2LL * tmp1 % mod * tmp2 % mod - 1LL + mod) % mod);
  return 0;
}
