#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
  int n;
  cin >> n;
  int dp[2 * n + 1][n + 1];
  for (int i = 0; i < n + 1; i++) dp[0][i] = 0;
  dp[0][0] = 1;
  for (int i = 1; i <= 2 * n; i++) {
    for (int j = 0; j <= n; j++) dp[i][j] = 0;
    dp[i][1] += dp[i - 1][0];
    for (int j = 1; j < n; j++) {
      dp[i][j - 1] += dp[i - 1][j];
      dp[i][j + 1] += dp[i - 1][j];
    }
    dp[i][n - 1] += dp[i - 1][n];
    for (int j = 0; j <= n; j++) {
      dp[i][j] %= MOD;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = n + 1; j < 2 * n + 1 - i; j++) {
      dp[j + i][n - i] = 0;
    }
  }
  int ans = 0;
  for (int i = 1; i <= 2 * n; i += 2) {
    for (int j = 0; j <= n; j++) {
      ans += dp[i][j];
      ans %= MOD;
    }
  }
  cout << ans;
}
