#include <bits/stdc++.h>
using namespace std;
long long fact[200105];
long long bigmod(long long a, long long b, long long mod) {
  if (b == 0) return 1 % mod;
  if (b % 2) return (a * bigmod(a, b - 1, mod)) % mod;
  long long sv = bigmod(a, b / 2, mod);
  sv *= sv;
  return sv % mod;
}
int main() {
  fact[0] = 1LL;
  for (long long i = 1; i < 200105; i++)
    fact[i] = (i * fact[i - 1]) % 1000000007LL;
  int n;
  scanf("%d", &n);
  long long res = fact[n + n - 1];
  res *= bigmod(fact[n - 1], 1000000007LL - 2, 1000000007LL);
  res %= 1000000007LL;
  res *= bigmod(fact[n], 1000000007LL - 2, 1000000007LL);
  res %= 1000000007LL;
  res *= 2;
  res %= 1000000007LL;
  res -= n;
  res += 1000000007LL;
  res %= 1000000007LL;
  printf("%lld\n", res);
  return 0;
}
