#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7LL;
const int maxn = 2002000;
long long f[maxn], inv[maxn];
long long pow_mod(long long a, long long b, long long c) {
  long long ans = 1;
  while (b) {
    if (b % 2) ans = ans * a % c;
    a = a * a % c;
    b /= 2;
  }
  return ans;
}
long long C(long long n, long long m) {
  if (n < m) return 0;
  return f[n] * inv[m] % mod * inv[n - m] % mod;
}
int main() {
  f[0] = 1;
  for (int i = 1; i < maxn; i++) f[i] = f[i - 1] * i % mod;
  for (int i = 0; i < maxn; i++) inv[i] = pow_mod(f[i], mod - 2, mod);
  int n;
  while (cin >> n) {
    n++;
    long long ans = C(2 * n, n) - 1;
    ans = (ans % mod + mod) % mod;
    cout << ans << endl;
  }
  return 0;
}
