#include <bits/stdc++.h>
using namespace std;
int M = 1000000007;
long long powermod(long long base, int power, int mod = M) {
  if (power == 0) return 1;
  long long k = powermod(base, power / 2, mod);
  k = (k * k) % mod;
  return (power % 2 == 1 ? (k * base) % mod : k);
}
long long inverse(int n, int mod = M) {
  return powermod(n, mod - 2, mod) % mod;
}
int main() {
  long long n;
  cin >> n;
  long long ans = 1;
  for (long long i = 2 * n + 2; i > n + 1; i--) ans = (ans * i) % M;
  for (long long i = n + 1; i > 0; i--) ans = (ans * inverse(i)) % M;
  cout << (ans - 1 + M) % M;
}
