#include <bits/stdc++.h>
using namespace std;
const long long p = 1000000007;
long long inv[2000010];
long long invf[2000010];
long long fac[2000010];
int n;
long long C(int a, int b) {
  return 1ll * fac[a] * invf[b] % p * invf[a - b] % p;
}
int main() {
  scanf("%d", &n);
  inv[0] = invf[0] = invf[1] = inv[1] = fac[1] = 1;
  for (int i = 2; i <= 2 * n - 1; i++) {
    fac[i] = (1ll * fac[i - 1] * i) % p;
    inv[i] = 1ll * (p - p / i) * inv[p % i] % p;
    invf[i] = 1ll * invf[i - 1] * inv[i] % p;
  }
  printf("%lld", (p + 2 * C(2 * n - 1, n - 1) - n) % p);
}
