#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const int N = 5e6 + 10;
const int p = 1e9 + 7;
long long fac[maxn], inv[maxn];
void init() {
  fac[0] = inv[0] = inv[1] = 1;
  for (long long i = 1; i < maxn; i++) fac[i] = fac[i - 1] * i % p;
  for (long long i = 2; i < maxn; i++) inv[i] = (p - p / i) * inv[p % i] % p;
  for (long long i = 1; i < maxn; i++) inv[i] = inv[i - 1] * inv[i] % p;
}
long long C(long long n, long long m) {
  return fac[n] * inv[m] % p * inv[n - m] % p;
}
int main() {
  init();
  int n;
  scanf("%d", &n);
  printf("%lld\n", ((C(2 * n, n) - n) % p + p) % p);
  return 0;
}
