#include <bits/stdc++.h>
using namespace std;
const int N = 1000006;
const int LOGN = (int)log2(N) + 2;
int SQRTN = (int)sqrt(N) + 7;
const long long infi = 1ll << 60;
long long n, m, k, x, y, idx, a, b, tests, arr[N], up[N], down[N], ans, q, d;
string second, t;
vector<long long> vec;
long long fact[N];
long long powMod(long long a, long long b, long long m) {
  long long r = 1;
  while (b) {
    if (b % 2) r = (r * a) % m;
    a = (a * a) % m;
    b /= 2;
  }
  return r;
}
long long c(long long n, long long k) {
  long long fo2 = fact[n];
  long long t7t = powMod(fact[n - k], 1000000007 - 3, 1000000007);
  long long ret = fo2 * t7t;
  ret %= 1000000007;
  ret += 1000000007;
  return ret % 1000000007;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  cin >> n;
  fact[0] = 1;
  for (int(i) = (1); (i) <= (int)(3e5); ++(i))
    fact[i] = (long long)i * fact[i - 1], fact[i] %= 1000000007;
  ans = c(2 * n, n);
  ans -= n;
  ans %= 1000000007;
  ans += 1000000007;
  ans %= 1000000007;
  cout << ans << endl;
  return 0;
}
