#include <bits/stdc++.h>
using namespace std;

const int mod = 1e9 + 7;

// O(4^n * n^2)

int solve_naive(int n) {
  int64_t ans = 0;
  for (int i = n; i <= 2 * n; i++) {
    int64_t pat = 0;
    for (int j = 0; j < (1LL << i); j++) {
      int pos = 0;
      bool ok = 1;
      for (int k = 0; k < i; k++) {
        if (pos == n) {
          ok = false;
          break;
        }
        if ((1LL << k) & j) pos++;
        else pos--;
      }
      if (ok && pos == n) pat += 1;
    }
    (ans += pat) %= mod;
  }
  return ans;
}

signed main() {
  int n;
  cin >> n;
  cout << solve_naive(n) << endl;
  return 0;
}