#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int B = 1e9 + 7;
int n;
long long inv[N];
long long mypow(long long a, int b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a % B;
    a = a * a % B;
    b >>= 1;
  }
  return res;
}
long long C(long long a, int b) {
  long long res = 1;
  for (int i = 0; i < b; ++i) {
    res = res * (a - i) % B;
  }
  for (int i = b; i >= 1; --i) {
    res = res * inv[i] % B;
  }
  return res;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    inv[i] = mypow(i, B - 2);
  }
  printf("%lld\n", (C(n + n - 1, n - 1) * 2 + B - n) % B);
  return 0;
}
