#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int maxn = 200005;
long long pw(long long a, long long n) {
  long long res = 1;
  for (; n > 0; n >>= 1) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long inv(long long a) { return pw(a, mod - 2); }
long long fact[maxn];
long long c(int n, int k) {
  long long res = fact[n] * inv(fact[k]) % mod;
  return res * inv(fact[n - k]) % mod;
}
int main() {
  fact[0] = 1;
  for (int i = 1; i < maxn; ++i) fact[i] = fact[i - 1] * i % mod;
  int n;
  scanf("%d", &n);
  long long res = c(2 * n - 1, n) % mod;
  res = (res + res) % mod;
  res = (res - n + mod) % mod;
  cout << res << endl;
  return 0;
}
