#include <bits/stdc++.h>
using namespace std;
long long n, p = 1000000007;
long long urbuu(long long k) {
  long long l, s = 1, m = k;
  l = p - 2;
  while (l > 0) {
    if (l % 2 == 1) s = (s * m) % p;
    m = (m * m) % p;
    l = l / 2;
  }
  return s;
}
int main() {
  long long s, i1 = 0, i, j, k, l, m;
  cin >> n;
  m = urbuu(n - 1);
  s = 0;
  l = 1;
  j = 1;
  for (i = n - 1; i <= 2 * n - 2; i++) {
    l = (l * i) % p;
    i1++;
    j = (j * (i1 - 1)) % p;
    if (j == 0) j++;
    s = (s + l * urbuu(j)) % p;
  }
  s = (s * m) % p;
  s = (s * 2 - n) % p;
  if (n == 1)
    cout << 1;
  else
    cout << s;
}
