#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e6 + 10;
int fact[2 * N];
int binpow(int x, int y) {
  int f = 1;
  while (y) {
    if (y & 1) f = 1LL * f * x % MOD;
    x = 1LL * x * x % MOD;
    y >>= 1;
  }
  return f;
}
int main() {
  int n;
  cin >> n;
  ++n;
  fact[0] = 1;
  for (int i = 1; i <= 2 * n; ++i) fact[i] = (1LL * fact[i - 1] * i) % MOD;
  cout << (1LL * 2 * fact[2 * n - 1] *
               binpow(1LL * fact[n] * fact[n - 1] % MOD, MOD - 2) % MOD +
           MOD - 1) %
              MOD;
  return 0;
}
