#include <bits/stdc++.h>
using namespace std;
struct $ {
  $() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
  }
} $;
const int Maxn = 200005;
long long Mod = 1e9 + 7;
long long fact[Maxn], ifact[Maxn];
long long power(long long x, long long y) {
  if (y == 0) return 1;
  long long temp = power(x, y >> 1);
  temp = (temp * temp) % Mod;
  if (y & 1) temp = (temp * x) % Mod;
  return temp;
}
long long inverse(long long x) { return power(x, Mod - 2); }
long long ncr(long long n, long long r) {
  if (r > n) return 0LL;
  if (r == n || r == 0) return 1LL;
  long long ret = (ifact[n - r] * ifact[r]) % Mod;
  ret = (ret * fact[n]) % Mod;
  return ret;
}
void pre() {
  fact[0] = ifact[0] = 1;
  for (int i = 1; i < Maxn; i++) {
    fact[i] = (fact[i - 1] * i) % Mod;
    ifact[i] = (ifact[i - 1] * inverse(i)) % Mod;
    assert((fact[i] * ifact[i]) % Mod == 1);
  }
}
int main() {
  int n;
  pre();
  cin >> n;
  long long ans = 2 * ncr(2 * n - 1, n) - n;
  ans = (ans + 10 * Mod) % Mod;
  cout << ans << endl;
  return 0;
}
