#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const int INF = (1 << 30) - 1;
const double EPS = 1e-9;
const int MOD = 1000000007;
int n;
void Load() { cin >> n; }
inline long long fpow(long long a, long long b, long long n) {
  long long res;
  for (res = 1; b > 0; b >>= 1, a = (a * a) % n)
    if (b & 1) res = (res * a) % n;
  return res;
}
inline long long Inv(long long n) { return fpow(n, MOD - 2, MOD); }
void Solve() {
  long long res = 1;
  for (int i = n + 1; i <= 2 * n; i++) res = (res * i) % MOD;
  for (int i = 1; i <= n; i++) res = (res * Inv(i)) % MOD;
  cout << (res - n + MOD) % MOD;
}
int main() {
  Load();
  Solve();
  return 0;
}
