#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int i, n, fact[300005], rs;
long long Pow(long long a, long long b) {
  long long ans = 1;
  while (b)
    if (b & 1)
      ans *= a, ans %= MOD, --b;
    else
      a *= a, a %= MOD, b /= 2;
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  for (i = fact[0] = 1; i <= 3e5; ++i) fact[i] = (1LL * fact[i - 1] * i) % MOD;
  cin >> n;
  rs = fact[2 * n];
  rs = (1LL * rs * Pow(fact[n], MOD - 2)) % MOD;
  rs = (1LL * rs * Pow(fact[n], MOD - 2)) % MOD;
  rs -= n;
  while (rs < 0) rs += MOD;
  cout << rs << '\n';
  return 0;
}
