#include <bits/stdc++.h>
using namespace std;
long long int modexp(long long int base, int ep) {
  if (ep == 0)
    return 1;
  else if (ep % 2)
    return (base * modexp(base, ep - 1)) % 1000000007;
  long long int sq = modexp(base, ep / 2);
  return (sq * sq) % 1000000007;
}
int main() {
  int n, i;
  scanf("%d", &n);
  n++;
  long long int tot = 1;
  for (i = 2; i <= n; i++) {
    tot *= i + n;
    tot %= 1000000007;
    tot *= modexp(i, 1000000007 - 2);
    tot %= 1000000007;
  }
  tot *= n + 1;
  tot %= 1000000007;
  tot = (tot + 1000000007 - 1) % 1000000007;
  printf("%lld\n", tot);
  return 0;
}
