#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long n, long long md) {
  if (n == 0)
    return 1 % md;
  else if (n % 2 == 1)
    return (powmod(a, n - 1, md) * a) % md;
  else {
    long long b = powmod(a, n / 2, md);
    return (b * b) % md;
  }
}
int main() {
  long long md = 1000000007;
  ios_base::sync_with_stdio(false);
  long long a, s;
  cin >> a;
  vector<long long> f(1000002);
  vector<long long> rf(1000002);
  f[0] = 1;
  rf[0] = 1;
  for (long long i = 1; i <= 1000000; i++) {
    f[i] = (f[i - 1] * i) % md;
    rf[i] = (md + powmod(f[i], md - 2, md)) % md;
  }
  s = 2 * (((f[2 * a - 1] * rf[2 * a - a]) % md * rf[a - 1]) % md) - a;
  cout << s % md;
}
