#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int maxn = 3000005, MOD = 1e9 + 7;
LL fac[maxn], inv[maxn], fac_inv[maxn];
LL C(LL n, LL m) { return fac[n] * fac_inv[m] % MOD * fac_inv[n - m] % MOD; }
int main() {
  fac[0] = 1;
  for (int i = 1; i <= 3000000; i++) fac[i] = fac[i - 1] * i % MOD;
  inv[1] = 1;
  for (int i = 2; i <= 3000000; i++)
    inv[i] = (LL)(MOD - MOD / i) * inv[MOD % i] % MOD;
  fac_inv[0] = 1;
  for (int i = 1; i <= 3000000; i++) fac_inv[i] = fac_inv[i - 1] * inv[i] % MOD;
  LL n;
  cin >> n;
  cout << (C(2LL * n + 2LL, n + 1LL) - 1LL + MOD) % MOD << '\n';
  return 0;
}
