#include <bits/stdc++.h>
using namespace std;
long long inv(long long x) {
  long long p = (long long)(1e9 + 7) - 2;
  long long ans = 1;
  while (p) {
    if (p & 1) {
      ans = (ans * x) % (long long)(1e9 + 7);
    }
    p /= 2;
    x = (x * x) % (long long)(1e9 + 7);
  }
  return ans;
}
int main() {
  int n;
  cin >> n;
  long long ans = 0;
  long long cnk = 1;
  for (int r = 0; r <= n; r++) {
    cnk = (cnk * inv(r + 1)) % (long long)(1e9 + 7);
    cnk = (cnk * (n + r + 1)) % (long long)(1e9 + 7);
    ans = (ans + cnk) % (long long)(1e9 + 7);
  }
  cout << ans << '\n';
}
