#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
#define MOD 1000000007LL
using namespace std;
typedef long long ll;

class ModuloCombination {
private:
  vector<ll> fact, inv_fact;

  static ll modulo_power(ll a, ll n) {
    if(n == 0) return 1;
    if(n % 2 == 0) return modulo_power((a * a) % MOD, n / 2);
    return (a * modulo_power(a, n - 1)) % MOD;
  }

public:
  ModuloCombination(ll N): fact(N + 1), inv_fact(N + 1) {
    fact[0] = 1;
    REP(i, 1, N + 1) fact[i] = (i * fact[i - 1]) % MOD;
    REP(i, 0, N + 1) inv_fact[i] = modulo_power(fact[i], MOD - 2);
  }

  ll operator()(ll n, ll r) {
    return fact[n] * inv_fact[r] % MOD * inv_fact[n - r] % MOD;
  }
};

int main(void) {
  ll N;
  cin >> N;

  ModuloCombination comb(N * 2);

  vector<ll> catalan(N + 1);
  catalan[0] = 1;
  REP(i, 1, N + 1) catalan[i] = (comb(2 * i, i) - comb(2 * i, i - 1) + MOD) % MOD;

  vector<ll> sum(N + 2, 0);
  REP(i, 0, N + 1) sum[i + 1] = (sum[i] + catalan[i]) % MOD;

  ll ans = 0;
  REP(i, 0, N / 2 + 1) {
    ll path = comb(N + i * 2, N + i);
    ans = (ans + path) % MOD;
    ans = (ans - (path * sum[N / 2 - i] * 2) % MOD + MOD) % MOD;
  }
  cout << ans << endl;
}