#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7, mod = 1e9 + 7;
int fac[N];
int pw(int x, int y) {
  if (y == 0) return 1;
  long long mid = pw(x, y / 2);
  mid *= mid;
  mid %= mod;
  if (y & 1) mid *= x;
  mid %= mod;
  return (int)mid;
}
int main() {
  fac[0] = 1;
  for (int i = 1; i < N; i++) fac[i] = fac[i - 1] * 1ll * i % mod;
  int n;
  cin >> n;
  cout << ((fac[2 * n] * 1ll * pw(pw(fac[n], mod - 2), 2)) - n + mod) % mod;
}
