#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
using namespace std;
long long fact[100000 + 1];
long long ifact[100000 + 1];
long long fastexpom(long long a, long long b, long long m) {
  long long res = 1;
  while (b > 0) {
    if (b % 2 == 1) res = (((res) % m) * ((a) % m)) % m;
    a = (((a) % m) * ((a) % m)) % m;
    b /= 2;
  }
  return res;
}
long long modinv(long long a, long long m = 1000000007) {
  return fastexpom(a, m - 2, m);
}
void preprocess() {
  fact[0] = ifact[0] = 1;
  for (long long i = 1; i <= 100000; i++) {
    fact[i] = (fact[i - 1] * i) % 1000000007;
    ifact[i] = modinv(fact[i]);
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  cin >> n;
  preprocess();
  if (n == 1) {
    cout << 1;
    return 0;
  }
  long long ans = n;
  for (long long i = 2; i <= n; i++) {
    long long lans = (fact[n - 1] * ifact[i - 1]) % 1000000007;
    lans = (lans * ifact[n - i]) % 1000000007;
    lans = (lans * 2) % 1000000007;
    lans = (lans * fact[n]) % 1000000007;
    lans = (lans * ifact[i]) % 1000000007;
    lans = (lans * ifact[n - i]) % 1000000007;
    ans = (ans + lans) % 1000000007;
  }
  cout << ans;
  return 0;
}
