#include <bits/stdc++.h>
using namespace std;

const int mod = 1e9 + 7;

const int MAX_N = 200000;
const int MAX_N2 = MAX_N * 2 + 1;

int64_t fact[MAX_N2];
int64_t revFact[MAX_N2];

int64_t powMod(int64_t x, int64_t y) {
  int64_t r = 1, a = x % mod;
  while (y) {
    if (y & 1) r = (r * a) % mod;
    a = a * a % mod;
    y /= 2;
  }
  return r;
}

void setup(int n) {
  fact[0] = 1;
  for (int i = 1; i < n; i++) {
    fact[i] = fact[i - 1] * i % mod;
  }
  revFact[n - 1] = powMod(fact[n - 1], mod - 2);
  for (int i = n - 2; i >= 0; i--) {
    revFact[i] = revFact[i + 1] * (i + 1) % mod;
  }
}

int64_t P(int n, int r) { return n >= r ? fact[n] * revFact[n - r] % mod : 0; }
int64_t C(int n, int r) { return P(n, r) * revFact[r] % mod; }

// O(n^2)

int solve_n2(int n) {
  int m = n / 2;

  vector<int> f(m + 1);
  f[0] = 1;

  int ans = f[0];

  for (int i = 1; i <= m; i++) {
    f[i] = C(n + 2 * i, i);
    for (int j = 0; j < i; j++) {
      f[i] -= f[j] * C((i - j) * 2, i - j) % mod;
      (f[i] += mod) %= mod;
    }
    (ans += f[i]) %= mod;
  }

  return ans;
}

signed main() {
  int n;
  cin >> n;
  setup(n * 2 + 1);
  cout << solve_n2(n) << endl;
  return 0;
}