#include <bits/stdc++.h>
using namespace std;
long long mul_inv(long long a, long long b) {
  long long b0 = b, t, q;
  long long x0 = 0, x1 = 1;
  if (b == 1) return 1;
  while (a > 1) {
    q = a / b;
    t = b, b = a % b, a = t;
    t = x0, x0 = x1 - q * x0, x1 = t;
  }
  if (x1 < 0) x1 += b0;
  return x1;
}
int main() {
  long long n;
  cin >> n;
  long long res = 1;
  for (long long i = 1; i <= n; i++) {
    long long temp = ((2 * n - i) * mul_inv(i, 1000000007)) % 1000000007;
    res = (res * temp) % 1000000007;
  }
  res = (2 * res - n) % 1000000007;
  if (res < 0) res += 1000000007;
  cout << res << endl;
  return 0;
}
