#include <bits/stdc++.h>
using namespace std;
long long f[2001000], MOD = 1e9 + 7, ans = 0;
int n;
long long inv(long long a) {
  long long ret = 1, b = MOD - 2;
  while (b) {
    if (b % 2) ret = (ret * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return ret;
}
long long nCr(int x, int y) {
  long long ret = f[x];
  ret = (ret * inv(f[y])) % MOD;
  ret = (ret * inv(f[x - y])) % MOD;
  return ret;
}
int main() {
  f[0] = 1;
  for (int i = 1; i <= 2000010; i++) {
    f[i] = (f[i - 1] * i) % MOD;
  }
  scanf("%d", &n);
  for (int i = 0; i <= n; i++) {
    ans = (ans + nCr(n + i + 1, i + 1)) % MOD;
  }
  cout << ans << "\n";
  return 0;
}
