#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, maxn = 100005;
int fact[maxn], inv[maxn];
void init(int n = 100000) {
  fact[0] = 1;
  for (int i = 1; i <= n; i++)
    fact[i] = (long long)i * fact[i - 1] % 1000000007;
  inv[1] = 1;
  for (int i = 2; i <= n; i++)
    inv[i] = 1000000007 -
             (long long)(1000000007 / i) * inv[1000000007 % i] % 1000000007;
  inv[0] = 1;
  for (int i = 1; i <= n; i++)
    inv[i] = (long long)inv[i - 1] * inv[i] % 1000000007;
}
int C(int n, int m) {
  return (long long)fact[n] * inv[m] % 1000000007 * inv[n - m] % 1000000007;
}
int main() {
  init();
  int n;
  while (~scanf("%d", &n)) {
    int ans = 0;
    for (int k = 1; k <= n; k++)
      ans = (ans + (long long)C(n, k) * C(n - 1, k - 1) % 1000000007) %
            1000000007;
    ans = ((ans + ans) % 1000000007 - n + 1000000007) % 1000000007;
    printf("%d\n", ans);
  }
  return 0;
}
