#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long INF = 4e18;
const int inf = 2e9;
const int N = 1e5;
const int N5 = N + 5;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
long long fact[2 * N5], ifact[2 * N5];
long long power(long long a, long long b) {
  if (!b) return 1LL;
  long long temp = power(a, b >> 1);
  temp *= temp;
  temp %= mod;
  if (b & 1) {
    temp *= a;
    temp %= mod;
  }
  return temp;
}
long long inv(long long a) { return power(a, mod - 2); }
long long c(int n, int k) {
  long long temp = fact[n];
  temp *= ifact[k];
  temp %= mod;
  temp *= ifact[n - k];
  temp %= mod;
  return temp;
}
int main(void) {
  int i, n;
  fact[0] = 1;
  ifact[0] = 1;
  for (i = 1; i <= 2 * N; ++i) {
    fact[i] = fact[i - 1] * i;
    fact[i] %= mod;
    ifact[i] = inv(fact[i]);
  }
  scanf("%d", &n);
  long long ans = c(2 * n - 1, n - 1);
  ans = (2 * ans - n) % mod;
  if (ans < 0) ans += mod;
  cout << ans << endl;
  return 0;
}
