#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const double eps = 1e-9;
int MOD = 1000000007;
long long inverse(long long n) {
  int pow = MOD - 2;
  long long res = 1;
  while (pow) {
    if (pow & 1) res = (res * n) % MOD;
    n = (n * n) % MOD;
    pow = pow >> 1;
  }
  return res;
}
long long binom(int n, int k) {
  long long res = 1;
  for (int i = n; i > k; --i) {
    res = (res * i) % MOD;
    res = (res * inverse(n - i + 1)) % MOD;
  }
  return res;
}
int main() {
  int N;
  cin >> N;
  long long res = binom(N * 2 - 1, N);
  res = res * 2 - N;
  res %= MOD;
  if (res < 0) res += MOD;
  cout << res << endl;
  return 0;
}
