#include <bits/stdc++.h>
using namespace std;
const int maxx = 2000010;
const double pi = acos(-1.0);
const double eps = 1e-15;
long long t, n, m;
long long ans = 0, total = 0, sum = 0, cnt = 0, l = 0, r = 0;
long long a[maxx], c[maxx];
long long ksm(long long x, long long p) {
  long long res = 1;
  while (p) {
    if (p & 1) res = res * x % 1000000007;
    x = x * x % 1000000007;
    p >>= 1;
  }
  return res;
}
int main() {
  scanf("%lld", &n);
  total = sum = 1;
  for (int i = 1; i <= n + 1; i++) sum = sum * (long long)i % 1000000007;
  for (int i = n + 2; i <= 2 * n + 2; i++)
    total = total * (long long)i % 1000000007;
  ans = total * ksm(sum, 1000000007 - 2) % 1000000007;
  ans--;
  printf("%lld", ans);
  return 0;
}
