#include <bits/stdc++.h>
using namespace std;
long long bigMod(long long x, long long n) {
  if (n == 0) return 1;
  long long t = bigMod(x, n / 2);
  t = ((t % 1000000007) * (t % 1000000007)) % 1000000007;
  if (n % 2) {
    t = ((x % 1000000007) * (t % 1000000007)) % 1000000007;
  }
  return t;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  long long p = 1, q = 1;
  for (int i = 1; i <= n + 1; i++) {
    q = (q * i) % 1000000007;
  }
  for (int i = n + 2; i <= 2 * n + 2; i++) {
    p = (p * i) % 1000000007;
  }
  p = (p * bigMod(q, 1000000007 - 2)) % 1000000007;
  p = (p - 1 + 1000000007) % 1000000007;
  cout << p << "\n";
  return 0;
}
