#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
  int n;
  scanf("%d", &n);
  vector<vector<long long>> a(2 * n + 1, vector<long long>(n + 1));
  a[0][0] = 1;
  for (int i = 1; i <= 2 * n; ++i) {
    for (int j = 0; j <= n; ++j) {
      if (j > 0) a[i][j] += a[i - 1][j - 1];
      if (j < n) a[i][j] += a[i - 1][j + 1];
      a[i][j] %= MOD;
      if (i > 2 * n - j) a[i][j] = 0;
    }
  }
  long long ans = 0;
  for (int j = 0; j < n; j += 2) {
    for (int i = j + 2; i <= 2 * n - j; i += 2) {
      ans += a[i][j] + 10 * MOD;
      if (j > 0) ans -= a[i - 1][j - 1];
      ans %= MOD;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
