#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int N = 1e6, MOD = 1e9 + 7;
int n;
template <typename T>
T modinv(T a, T m) {
  if (m == 1) return 0;
  T m0 = m, t, q;
  T x0 = 0, x1 = 1;
  while (a > 1) {
    q = a / m;
    t = m;
    m = a % m, a = t;
    t = x0;
    x0 = x1 - q * x0;
    x1 = t;
  }
  if (x1 < 0) x1 += m0;
  return x1;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout << fixed;
  cin >> n;
  int64_t ans = 1;
  for (int x = 2 * n + 2, i = 1; i <= n + 1; i++, x--) {
    ans = ans * x % MOD * modinv(i, MOD) % MOD;
  }
  cout << ans - 1 << endl;
  return 0;
}
