#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:16777216")
int fact[200010];
const int MOD = 1000000007;
int pow(int a, int k) {
  int ans = 1;
  while (k) {
    if (k & 1) ans = ((long long)ans * a) % MOD;
    a = ((long long)a * a) % MOD;
    k >>= 1;
  }
  return ans;
}
int inverse(int n) { return pow(n, MOD - 2); }
int main() {
  int n;
  cin >> n;
  fact[0] = 1;
  for (int i = (1); (i) <= (2 * n); ++(i))
    fact[i] = ((long long)fact[i - 1] * i) % MOD;
  int nf = inverse(fact[n]);
  int ans = fact[2 * n];
  ans = ((long long)ans * nf) % MOD;
  ans = ((long long)ans * nf) % MOD;
  ans = (ans + MOD - n) % MOD;
  cout << ans << endl;
  return 0;
}
