#include <bits/stdc++.h>
using namespace std;
long long int pow_mod(long long int a, long long int b) {
  long long int res = 1;
  while (b != 0) {
    if (b & 1) {
      res = (res * a) % 1000000007;
    }
    a = (a * a) % 1000000007;
    b /= 2;
  }
  return res;
}
long long int inv(long long int x) { return pow_mod(x, 1000000007 - 2); }
void solve() {
  long long int n;
  cin >> n;
  long long int x = 2 * n - 1;
  long long int y = n;
  long long int res1 = 1;
  for (long long int i = 0; i < y; i++) res1 = (res1 * (x - i)) % 1000000007;
  long long int res2 = 1;
  for (long long int i = 1; i <= y; i++) res2 = (res2 * i) % 1000000007;
  long long int ans = (res1 * inv(res2)) % 1000000007;
  ans *= 2;
  ans %= 1000000007;
  ans -= n;
  ans += 1000000007;
  ans %= 1000000007;
  cout << ans << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  t = 1;
  while (t--) solve();
  return 0;
}
