#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int MOD = 1000000007;
long long power(long long a, long long n, long long m) {
  if (n == 0) return 1;
  long long p = power(a, n / 2, m);
  p = (p * p) % m;
  if (n % 2) p = (p * a) % m;
  return p;
}
int fact[N];
int ifact[N];
int main() {
  fact[0] = 1;
  for (int i = 1; i < N; i++) {
    fact[i] = ((long long)i * fact[i - 1]) % MOD;
  }
  ifact[N - 1] = power(fact[N - 1], MOD - 2, MOD);
  for (int i = N - 1; i >= 1; i--) {
    ifact[i - 1] = ((long long)i * ifact[i]) % MOD;
  }
  int n;
  scanf("%d", &n);
  int ans = fact[2 * n - 1];
  ans = ((long long)ans * ifact[n]) % MOD;
  ans = ((long long)ans * ifact[n - 1]) % MOD;
  ans = (2 * ans) % MOD;
  ans = (ans - n + MOD) % MOD;
  printf("%d\n", ans);
  return 0;
}
