#include <bits/stdc++.h>
using namespace std;
int n;
long long MO = 1e9 + 7, ans;
long long c[200010];
long long qsm(long long x, long long k) {
  long long cnt = 1;
  while (k) {
    if (k & 1) cnt = (cnt * x) % MO;
    x = (x * x) % MO;
    k >>= 1;
  }
  return cnt;
}
int main() {
  scanf("%d", &n);
  c[0] = 1;
  for (int i = 1; i <= 2 * n; i++) c[i] = (c[i - 1] * i) % MO;
  ans = (c[2 * n - 1] * qsm((c[n] * c[n - 1]) % MO, MO - 2)) % MO;
  ans = (ans * 2 % MO + MO - n) % MO;
  printf("%lld\n", ans);
  return 0;
}
