#include <bits/stdc++.h>
using namespace std;
const int Mod = 1000000007;
int power(int a, int b) {
  int t = 1;
  for (; b; b = b >> 1) {
    if (b & 1) t = (long long)t * a % Mod;
    a = (long long)a * a % Mod;
  }
  return t;
}
int inv(int a) { return power(a, Mod - 2); }
int main() {
  int n;
  cin >> n;
  int ans = 0, pw = 1;
  for (int i = 0; i <= 2 * n; i++) {
    ans = (ans + pw) % Mod;
    pw = (pw << 1) % Mod;
  }
  int comb = 1;
  for (int i = 0; i < n; ++i) {
    ans = (ans - comb) % Mod;
    ans = (ans - comb) % Mod;
    comb = (long long)comb * (2 * n + 1 - i) % Mod * inv(i + 1) % Mod;
  }
  if (ans < 0) ans += Mod;
  cout << ans << endl;
}
