#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 10, mod = 1e9 + 7;
int n;
ll fact[N * 2], infact[N * 2];
ll qmi(ll a, ll b) {
  ll res = 1ll;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
void init() {
  fact[0] = infact[0] = 1;
  for (int i = 1; i < N * 2; i++) {
    fact[i] = fact[i - 1] * i % mod;
    infact[i] = infact[i - 1] * qmi(i, mod - 2) % mod;
  }
}
ll C(ll b, ll a) { return fact[a] * infact[a - b] % mod * infact[b] % mod; }
int main() {
  init();
  cin >> n;
  ll res = 1ll, k = 1ll;
  for (int i = 1; i <= n; i++) {
    k = k * 2 % mod;
    res = (res + k) % mod;
  }
  for (int i = n + 1; i <= n + n; i++) {
    k = ((k * 2 % mod - 2 * C(n, i - 1) % mod) + mod) % mod;
    res = (res + k) % mod;
  }
  cout << res << endl;
}
