#include <bits/stdc++.h>
using namespace std;
int J[1000005 * 2 + 2], FJ[1000005 * 2 + 2];
int n, i;
int ksm(int a, int b) {
  int tem = 1;
  while (b) {
    if (b & 1) tem = 1ll * tem * a % 1000000007;
    a = 1ll * a * a % 1000000007;
    b >>= 1;
  }
  return tem;
}
int C(int a, int b) {
  return 1ll * J[a] * FJ[a - b] % 1000000007 * FJ[b] % 1000000007;
}
int main() {
  scanf("%d", &n);
  J[0] = 1;
  for (i = 1; i <= 2 * n + 1; i++) J[i] = 1ll * J[i - 1] * i % 1000000007;
  FJ[n + 1] = ksm(J[n + 1], 1000000007 - 2);
  for (i = n; i >= 0; i--) FJ[i] = 1ll * FJ[i + 1] * (i + 1) % 1000000007;
  printf("%d\n",
         (C(2 * n + 1, n) * 2ll % 1000000007 - 1ll + 1000000007) % 1000000007);
  return 0;
}
