#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 15;
const int MOD = 1e9 + 7;
int dp[N][N];
int main() {
  int n;
  while (~scanf("%d", &n)) {
    memset(dp, 0, sizeof(dp));
    for (int i = 0; i <= n; i++) {
      dp[i][0] = 1;
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= i; j++) {
        dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % MOD;
        if ((i + j) & 1) {
          ans = (ans + dp[i][j]) % MOD;
        }
      }
    }
    printf("%d\n", (ans + (n + 1) / 2) % MOD);
  }
}
