#include <bits/stdc++.h>
using namespace std;
long long mul_inv(long long a, long long b) {
  long long b0 = b, t, q;
  long long x0 = 0, x1 = 1;
  if (b == 1) return 1;
  while (a > 1) {
    q = a / b;
    t = b, b = a % b, a = t;
    t = x0, x0 = x1 - q * x0, x1 = t;
  }
  if (x1 < 0) x1 += b0;
  return x1;
}
long long division(long long a, long long b, long long p) {
  long long ans, inv;
  inv = mul_inv(b, p);
  ans = ((a % p) * inv) % p;
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, i, j, k, ss, MOD = 1000000007, nn, ans, a, b, res;
  cin >> n;
  nn = 2 * n + 100;
  vector<long long> f(nn), v(n, 0), s(n, 0);
  f[0] = 1;
  for (i = 1; i < nn; i++) f[i] = (f[i - 1] * i) % MOD;
  if (n == 1)
    ans = 1;
  else {
    for (i = 1; i < n; i++) {
      a = n - 1 + i - 1;
      b = n - 2;
      res = division(f[a], f[b], MOD);
      res = division(res, f[a - b], MOD);
      v[i] = res;
      s[i] = s[i - 1] + res;
    }
    ans = 0;
    for (i = 1; i < n; i++) {
      ans += s[n - i];
    }
    ans = (2 * ans + n) % MOD;
  }
  cout << ans << "\n";
  return 0;
}
