#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n;
const int mod = 1e9 + 7;
long long fact[N * 2 + 1];
int powmod(int a, int b) {
  int res = 1;
  while (b)
    if (b & 1)
      res = (res * 1ll * a) % mod, --b;
    else
      a = (a * 1ll * a) % mod, b >>= 1;
  return res;
}
int main() {
  cin >> n;
  long long f = 1;
  fact[0] = fact[1] = 1;
  for (int i = 2; i <= N * 2; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
  }
  long long ans = fact[n + (n - 1)];
  long long inv = (fact[n - 1] * fact[n]) % mod;
  inv = powmod(inv, mod - 2);
  ans = ans * inv * 2;
  cout << (ans - n) % mod;
}
