#include <bits/stdc++.h>
using namespace std;
int n, ans;
long long fk[2000003] = {1}, inv;
const int mod = 1e9 + 7;
int powmod(long long x, int y) {
  long long res = 1;
  while (y) {
    if (y & 1) res = res * x % mod;
    y >>= 1;
    x = x * x % mod;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  for (int i = 1; i < 2000003; ++i) fk[i] = fk[i - 1] * i % mod;
  cin >> n;
  inv = powmod(fk[n + 1], mod - 2);
  ans = (fk[n * 2 + 2] * inv % mod) * inv % mod - 1;
  if (ans < 0) ans += mod;
  cout << ans << '\n';
}
