#include <bits/stdc++.h>
using namespace std;
const int N = -1;
const int INF = 1e9 + 19;
const int MOD = 1e9 + 7;
long long binPow(long long a, long long b) {
  long long res = 1;
  for (; b > 0; b /= 2) {
    if (b % 2 == 1) {
      res = (res * a) % MOD;
    }
    a = (a * a) % MOD;
  }
  return res;
}
void read() {
  int n;
  scanf("%d", &n);
  n = n + 1;
  long long fact2n = 1;
  long long factn = 1;
  for (int i = 1; i <= n * 2; i++) fact2n = (fact2n * i) % MOD;
  for (int i = 1; i <= n; i++) factn = (factn * i) % MOD;
  long long rev = binPow(factn, MOD - 2);
  long long answer = fact2n * rev % MOD * rev;
  answer = (answer + MOD - 1) % MOD;
  cout << answer << endl;
}
void solve() {}
void printAns() {}
void stress() {}
int main() {
  if (1) {
    int k = 1;
    for (int tt = 0; tt < k; tt++) {
      read();
      solve();
      printAns();
    }
  } else {
    stress();
  }
  return 0;
}
