#include <bits/stdc++.h>
using namespace std;
long long pow_mod(long long x, long long y) {
  long long ret = 1;
  while (y) {
    if (y & 1) ret = (ret * x) % 1000000007;
    x = (x * x) % 1000000007;
    y >>= 1;
  }
  return ret;
}
long long f[2000010];
void init() {
  f[0] = 1;
  for (int i = 1; i <= 2000005; i++) f[i] = (f[i - 1] * i) % 1000000007;
}
long long inv(long long x) { return pow_mod(x, 1000000007 - 2); }
long long C(long long x, long long y) {
  long long ret;
  ret = (f[x] * inv(f[y])) % 1000000007;
  ret = (ret * inv(f[x - y])) % 1000000007;
  return ret;
}
int main() {
  init();
  int n;
  scanf("%d", &n);
  long long ans = 0;
  for (int i = 0; i <= n; i++) ans = (ans + C(i + n + 1, n)) % 1000000007;
  cout << ans << endl;
}
