#include <bits/stdc++.h>
using namespace std;
const long long int infinity = 9e18;
bool compare(int a, int b) { return a > b; }
bool compare1(pair<int, int> a, pair<int, int> b) { return a.first > b.first; }
bool compare2(pair<int, int> a, pair<int, int> b) {
  return a.second < b.second;
}
long long int Npower(long long int a, long long int b) {
  long long int product = 1;
  while (b) {
    if (b & 1) {
      product = product * a;
    }
    a = a * a;
    b = b >> 1;
  }
  return product;
}
long long int power(long long int a, long long int b, long long int md) {
  long long int product = 1;
  while (b) {
    if (b & 1) {
      product = ((product % md) * (a % md)) % md;
    }
    a = ((a % md) * (a % md)) % md;
    b = b >> 1;
  }
  return product % md;
}
bool isprime(long long int n) {
  if (n < 2) return 0;
  long long int i = 2;
  while (i * i <= n) {
    if (n % i == 0) return 0;
    i++;
  }
  return 1;
}
long long int GCD(long long int a, long long int b) {
  return b == 0 ? a : GCD(b, a % b);
}
long long int LCM(long long int a, long long int b) {
  return (a / GCD(a, b)) * b;
}
long long int fact[2000005];
void factorial() {
  fact[0] = 1;
  for (long long int i = 1; i < 2000005; i++) {
    fact[i] = (i * (fact[i - 1])) % 1000000007;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  factorial();
  long long int n;
  cin >> n;
  long long int val = (fact[n + 1] * fact[n + 1]) % 1000000007;
  val = power(val, 1000000007 - 2, 1000000007);
  long long int ans =
      ((fact[2 * n + 2] * val) % 1000000007 + 1000000007 - 1) % 1000000007;
  cout << ans;
  return 0;
}
