#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-9;
int get(int n) {
  int cnt = 0;
  for (int i1 = 1; i1 <= n; ++i1)
    for (int i2 = 1; i2 <= n; ++i2)
      for (int i3 = 1; i3 <= n; ++i3)
        for (int i4 = 1; i4 <= n; ++i4)
          if ((i1 <= i2 && i2 <= i3 && i3 <= i4) ||
              (i1 >= i2 && i2 >= i3 && i3 >= i4)) {
            cnt++;
          }
  return cnt;
}
const long long mod = 1000000007;
int mpow(long long a, long long n, long long mod) {
  if (n == 0) return 1 % mod;
  long long r = mpow(a, n / 2, mod);
  r = (r * r) % mod;
  if (n & 1) r = (r * a) % mod;
  return r;
}
long long fact(int n, long long mod) {
  long long res = 1;
  for (int i = 1; i <= n; ++i) res = (res * i) % mod;
  return res;
}
int main() {
  int n;
  cin >> n;
  long long fn = fact(n, mod);
  long long f2n = fact(2 * n, mod);
  long long invfn = mpow(fn, mod - 2, mod);
  long long res = ((((f2n * invfn) % mod) * invfn) % mod);
  res -= n;
  res %= mod;
  res += mod;
  res %= mod;
  cout << res << endl;
  return 0;
}
