#include <bits/stdc++.h>
using namespace std;
double PI = 4.00 * (atan(1));
long long int expo(long long int base, long long int power) {
  long long int result = 1;
  while (power != 0) {
    if (power & 1) {
      result = (result * base) % 1000000007;
    }
    base = (base * base) % 1000000007;
    power = power >> 1;
  }
  return result;
}
long long int modinvevrse(long long int x) {
  long long int temp = 1000000007 - 2;
  return expo(x, temp);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  long long int fact1, fact2;
  fact1 = 1;
  for (long long int i = 2; i <= n; i++) {
    fact1 = (fact1 * i) % 1000000007;
  }
  fact2 = fact1;
  for (long long int i = (n + 1); i <= (2 * n); i++) {
    fact2 = (fact2 * i) % 1000000007;
  }
  long long int ans = modinvevrse(fact1);
  ans = (ans * ans) % 1000000007;
  ans = (ans * fact2) % 1000000007;
  ans = (ans - n + 1000000007) % 1000000007;
  cout << ans;
  return 0;
}
