#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long n, ans = 0;
long long jc[200005], inv[200005];
long long quick_power(long long x, long long y) {
  long long res = 1;
  for (; y; y = y >> 1, x = (x * x) % mod)
    if (y & 1) res = (res * x) % mod;
  return res;
}
void init() {
  jc[0] = 1;
  for (long long i = 1; i <= 2 * n; i++) jc[i] = (jc[i - 1] * i) % mod;
  inv[n] = quick_power(jc[n], mod - 2);
  for (long long i = n - 1; i >= 1; i--) inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
long long C(long long x, long long y) {
  return ((jc[x] * inv[y]) % mod * inv[x - y]) % mod;
}
signed main() {
  cin >> n;
  init();
  if (n == 1)
    ans = 1;
  else
    ans = ((2 * C(2 * n - 1, n) - n) % mod + mod) % mod;
  cout << ans << endl;
  return 0;
}
