#include <bits/stdc++.h>
using namespace std;
const long long p = 1000000007;
long long f[200000], a, b, x, y, n;
long long gcdex(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long x1, y1;
  long long d = gcdex(b, a % b, x1, y1);
  x = y1;
  x = (x + p * p) % p;
  y = x1 - (a / b) * y1;
  y = (y + p * p) % p;
  return d;
}
int main() {
  f[0] = 1;
  scanf("%lld", &n);
  for (long long i = 1; i <= 2 * n; i++) f[i] = (i * f[i - 1]) % p;
  a = f[2 * n];
  b = (f[n] * f[n]) % p;
  gcdex(b, p, x, y);
  a = (a * x - n + p) % p;
  printf("%lld\n", a);
  return 0;
}
