#include <bits/stdc++.h>
using namespace std;
long long n;
const long long MAXN = 2000 * 1000 + 7, MOD = 1000 * 1000 * 1000 + 7;
long long fact[MAXN];
inline long long mul(long long a, long long b) {
  return ((a % MOD) * (b % MOD)) % MOD;
}
long long Pow(long long a, long long b) {
  if (b == 0) return 1ll;
  long long x = Pow(a, b / 2);
  x = mul(x, x);
  if (b % 2) x = mul(x, a);
  return x;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n;
  n++;
  fact[0] = 1;
  for (long long i = 1; i < MAXN; i++) fact[i] = mul(fact[i - 1], i);
  long long ans = mul(fact[2 * n - 1], 2ll);
  long long m = mul(fact[n], fact[n - 1]);
  ans = mul(ans, Pow(m, MOD - 2));
  ans--;
  if (ans < 0) ans += MOD;
  cout << ans << endl;
  return 0;
}
