#include <bits/stdc++.h>
using namespace std;
int const m = 1000000007;
int const N = 100001;
long long fc[N], inv[N];
long long pw(int x, int p) {
  if (p == 0) return 1;
  long long c = pw(x, p / 2);
  if (p & 1) return ((c * c) % m * x) % m;
  return (c * c) % m;
}
long long can(long long n, long long k) {
  return ((fc[n] * inv[k]) % m * inv[n - k]) % m;
}
int main() {
  fc[0] = 1;
  inv[0] = 1;
  for (int i = 1; i < N; i++) {
    fc[i] = (i * fc[i - 1]) % m;
    inv[i] = pw(fc[i], m - 2);
  }
  int n;
  cin >> n;
  long long ans = 0;
  for (int k = 1; k <= n; k++) {
    ans = (ans + can(n, k) * can(n - 1, k - 1)) % m;
  }
  ans = (2 * ans - n) % m;
  cout << ans;
  return 0;
}
