#include <bits/stdc++.h>
using namespace std;
const int N = 5000000;
const int mod = 1000000007;
long long int f[N];
long long int n;
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    a = (a * a) % mod;
    b /= 2;
  }
  return ans;
}
int main() {
  f[0] = 1;
  for (long long int i = 1; i <= N - 5; i++) {
    f[i] = (f[i - 1] * i) % mod;
  }
  cin >> n;
  n += 1;
  long long int p = f[2 * n];
  long long int q = (f[n] * f[n]) % mod;
  p = (p * power(q, mod - 2)) % mod;
  p = (p - 1 + mod) % mod;
  cout << p << '\n';
  return 0;
}
