#include <bits/stdc++.h>
using namespace std;
const int mo = 1000000007;
int POW(int a, int b) {
  int ans = 1;
  for (; b; b >>= 1, a = (long long int)a * a % mo)
    if (b & 1) ans = (long long int)ans * a % mo;
  return ans;
}
const int maxn = 3033333;
static int fac[maxn];
inline int combo(int n, int m) {
  return (long long int)fac[n] *
         POW((long long int)fac[m] * fac[n - m] % mo, mo - 2) % mo;
}
int main() {
  int n;
  scanf("%d", &n);
  fac[0] = 1;
  for (int i = 1; i < maxn; ++i) fac[i] = (long long int)fac[i - 1] * i % mo;
  printf("%d\n", (2 * combo(2 * n + 1, n + 1) % mo + (mo - 1)) % mo);
}
