#include <bits/stdc++.h>
using namespace std;
long long n, m, inv[3001000], s[3001000], ans;
long long ksm(long long x, long long k) {
  long long tmp = 1;
  while (k) {
    if (k % 2 == 1) tmp *= x, tmp %= 1000000007;
    x = x * x % 1000000007;
    k /= 2;
  }
  return tmp;
}
long long C_c(long long a, long long b) {
  if (b < a) return 0;
  if (a == 0) return 1;
  if (b == 0) return 0;
  return s[b] * inv[b - a] % 1000000007 * inv[a] % 1000000007;
}
int main() {
  cin >> n;
  s[0] = 1;
  for (long long i = 1; i <= 2 * n; i++) {
    s[i] = s[i - 1] * i % 1000000007;
    inv[i] = ksm(s[i], 1000000007 - 2);
  }
  for (long long i = 0; i < n; i++) {
    ans += C_c(n - 1, 2 * n - i - 1);
    ans %= 1000000007;
  }
  cout << (ans - n + 1000000007 + 1) % 1000000007;
}
