#include <bits/stdc++.h>
using namespace std;
int n;
int dp[1001][1001][2];
int main() {
  scanf("%d", &n);
  for (int i = 0; i <= n; i++) dp[0][i][0] = (i + 1) / 2, dp[0][i][1] = i / 2;
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++)
      if (i == j)
        dp[i][j][0] = (dp[i - 1][j][1] + 1), dp[i][j][1] = dp[i - 1][j][0];
      else
        dp[i][j][0] = ((dp[i - 1][j][1] + dp[i][j - 1][0] + 1) % 1000000007),
        dp[i][j][1] = ((dp[i - 1][j][0] + dp[i][j - 1][0]) % 1000000007);
  printf("%d\n", dp[n][n][0]);
  return 0;
}
