#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 15;
const long long mod = 1e9 + 7;
long long fac[N], ifac[N], inv[N];
void pre() {
  inv[1] = 1;
  for (int n = 2; n < N; n++) {
    inv[n] = (mod - mod / n) * inv[mod % n] % mod;
  }
  fac[0] = ifac[0] = 1;
  for (int i = 1; i < N; i++) {
    fac[i] = i * fac[i - 1] % mod;
    ifac[i] = inv[i] * ifac[i - 1] % mod;
  }
}
inline long long ncr(int n, int r) {
  if (r < 0 || r > n || n < 0) return 0;
  return fac[n] * (ifac[r] * ifac[n - r] % mod) % mod;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout << setprecision(32);
  pre();
  int n;
  cin >> n;
  long long ans = (2 * ncr(2 * n - 1, n - 1) - n) % mod;
  if (ans < 0) ans += mod;
  cout << ans << '\n';
  return 0;
}
