#include <bits/stdc++.h>
using namespace std;
const int N = (int)(4e5) + 1, M = 1001, mod = (int)(1e9) + 7;
long long fac[N], inv[N];
long long fp(long long x, long long y) {
  long long ret = 1;
  while (y) {
    if (y & 1) ret = ((ret % mod) * (x % mod)) % mod;
    y >>= 1;
    x = ((x % mod) * (x % mod)) % mod;
  }
  return ret % mod;
}
void fill_() {
  fac[0] = inv[0] = 1;
  for (int i = 1; i < N; i++) {
    fac[i] = ((i % mod) * (fac[i - 1] % mod)) % mod;
    inv[i] = fp(fac[i], mod - 2);
  }
}
long long nCr(int n, int r) {
  return (((fac[n] % mod) * (inv[n - r] % mod)) % mod * (inv[r] % mod)) % mod;
}
int main() {
  ios::sync_with_stdio(0);
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  fill_();
  int n;
  cin >> n;
  cout << ((((2 * (nCr(2 * n - 1, n - 1) % mod)) % mod) - n) + mod) % mod;
  return 0;
}
