#include <bits/stdc++.h>
using namespace std;
long long n, ans, mod = 1e9 + 7, fact[500500];
long long fastPower(long long first, long long second) {
  if (second == 0) return 1;
  long long res1 = 1, res2 = 1;
  if (second & 1) res2 = first;
  res1 = fastPower(first, second / 2);
  res1 = (res1 * res1) % mod;
  return (res1 * res2) % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  fact[0] = 1;
  for (int i = 1; i <= n; i++) fact[i] = (i * fact[i - 1]) % mod;
  for (int i = 0; i < n; i++) {
    ans += (((fact[n - 1] *
              fastPower((fact[i] * fact[n - 1 - i]) % mod, mod - 2)) %
             mod) *
            ((fact[n] *
              fastPower((fact[i + 1] * fact[n - 1 - i]) % mod, mod - 2)) %
             mod)) %
           mod;
  }
  ans = (ans * 2) % mod;
  ans = (ans - n + mod) % mod;
  cout << ans;
}
