#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
long long f[3000001];
long long invf[3000001];
long long power(long long b, long long e) {
  if (e == 0) {
    return 1LL;
  } else if (e == 1) {
    return b;
  } else {
    long long p = power(b, e / 2);
    if (e % 2 == 0) {
      return (p * p) % 1000000007;
    } else {
      p = (p * p) % 1000000007;
      p = (p * b) % 1000000007;
      return p;
    }
  }
}
int main() {
  int n;
  scanf("%d", &n);
  f[0] = 1LL;
  for (int(i) = (1); (i) < (3000001); ++(i)) {
    f[i] = (f[i - 1] * i) % 1000000007;
  }
  invf[3000000] = power(f[3000000], 1000000007 - 2);
  for (int(i) = (2999999); (i) > (-1); --(i)) {
    invf[i] = (invf[i + 1] * (i + 1)) % 1000000007;
  }
  long long answer1 = 0;
  n++;
  answer1 = f[2 * n];
  answer1 = (answer1 * invf[n]) % 1000000007;
  answer1 = (answer1 * invf[n]) % 1000000007;
  answer1 = ((answer1 - 1) % 1000000007 + 1000000007) % 1000000007;
  printf("%lld\n", answer1);
  return 0;
}
