#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long long int inv(long long int a) {
  long long int ans = 1, b = mod - 2;
  while (b > 0) {
    if (b & 1) {
      ans = (ans * a) % mod;
    }
    a = (a * a) % mod;
    b = b >> 1;
  }
  return ans;
}
long long int giveans(long long int n) {
  long long int ans = 1, i = 1, tmp = n, nck = n, nm1ck = n - 1;
  ans = 2;
  for (i = n; i < 2 * n; i++) {
    ans = (ans * i) % mod;
    ans = ans * inv(i - n + 1);
    ans = ans % mod;
  }
  return ans;
}
int main() {
  long long int n, ans;
  scanf("%lld", &n);
  ans = giveans(n) - n;
  ans = (ans + mod) % mod;
  printf("%lld\n", ans);
  return 0;
}
