#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, MOD = 1e9 + 7;
int f[N];
inline int binpow(int a, int n) {
  int res = 1;
  while (n > 0) {
    if (n & 1) {
      res = (1LL * res * a) % MOD;
    }
    a = (1LL * a * a) % MOD;
    n >>= 1;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  f[0] = 1;
  for (int i = 1; i < N; i++) {
    f[i] = (1LL * f[i - 1] * i) % MOD;
  }
  int n;
  cin >> n;
  int ans = f[2 * n];
  ans = (1LL * ans * binpow(f[n], MOD - 2)) % MOD;
  ans = (1LL * ans * binpow(f[n], MOD - 2)) % MOD;
  ans = (ans - n + MOD) % MOD;
  cout << ans;
}
