#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 3;
const int mod = 1e9 + 7;
int n, fac[N << 1], inv[N << 1];
void init() {
  inv[1] = 1;
  for (int i = 2; i <= 2 * n; i++)
    inv[i] = 1LL * (mod - mod / i) * inv[mod % i] % mod;
  inv[0] = 1;
  for (int i = 1; i <= 2 * n; i++) inv[i] = 1LL * inv[i - 1] * inv[i] % mod;
  fac[0] = 1;
  for (int i = 1; i <= 2 * n; i++) fac[i] = 1LL * fac[i - 1] * i % mod;
}
int C(int a, int b) { return 1LL * fac[a] * inv[b] % mod * inv[a - b] % mod; }
int main() {
  scanf("%d", &n);
  init();
  printf("%d\n", (2 * C(2 * n - 1, n) - n) % mod);
  return 0;
}
