#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long quick_pow(long long a, long long x) {
  long long pow_a = a, ans = 1;
  while (x > 0) {
    if (x & 1) ans = (ans * pow_a) % MOD;
    pow_a = (pow_a * pow_a) % MOD;
    x >>= 1;
  }
  return ans;
}
long long calc_modular_inverse_fermat(long long a) {
  return quick_pow(a, MOD - 2);
}
long long calc_comb_direct(int n, int m) {
  if (n < m) return 0;
  long long numerator = 1, denominator = 1;
  for (int i = n; i > m; i--) numerator = (numerator * i) % MOD;
  for (int i = n - m; i > 1; i--) denominator = (denominator * i) % MOD;
  return (numerator * calc_modular_inverse_fermat(denominator)) % MOD;
}
long long N;
int main() {
  cin >> N;
  long long C = calc_comb_direct(2 * N - 1, N);
  long long ans = (2 * C - N) % MOD;
  ans = (ans + MOD) % MOD;
  cout << ans << endl;
  return 0;
}
