#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long fac[100002], inv[100002];
long long fast(long long a, long long b) {
  if (b == 0) return 1;
  long long ans = fast(a, b / 2);
  if (b % 2 == 1) return ((ans * ans) % mod * a) % mod;
  return (ans * ans) % mod;
}
long long nCk(long long n, long long k) {
  return ((fac[n] * inv[k]) % mod * inv[n - k]) % mod;
}
int main() {
  long long n;
  cin >> n;
  fac[0] = 1;
  inv[0] = fast(fac[0], mod - 2) % mod;
  for (int i = 1; i <= 100000; i++) {
    fac[i] = (fac[i - 1] * i) % mod;
    inv[i] = fast(fac[i], mod - 2) % mod;
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans = (ans + (nCk(n, i) * nCk(n - 1, i - 1)) % mod) % mod;
  }
  ans = (ans * 2 - n + mod) % mod;
  cout << ans;
  return 0;
}
