#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const int maxn = 3e5 + 5;
const int INF = 0x3f3f3f3f;
const long long inf = 1e18 + 5;
inline int read() {
  int ret = 0, sgn = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') sgn = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    ret = ret * 10 + ch - '0';
    ch = getchar();
  }
  return ret * sgn;
}
inline void Out(int a) {
  if (a > 9) Out(a / 10);
  putchar(a % 10 + '0');
}
int qpow(int m, int k, int mod) {
  int res = 1, t = m;
  while (k) {
    if (k & 1) res = res * t % mod;
    t = t * t % mod;
    k >>= 1;
  }
  return res;
}
long long __gcd(long long a, long long b) {
  return b == 0 ? a : __gcd(b, a % b);
}
int dp[1004][1004][2];
int n;
int i, j, k;
int main() {
  scanf("%d", &n);
  memset(dp, 0, sizeof(dp));
  for (i = 0; i <= n; ++i) {
    dp[0][i][1] = i / 2;
    dp[0][i][0] = (i + 1) / 2;
  }
  for (i = 1; i <= n; ++i) {
    for (j = i; j <= n; ++j) {
      if (i == j) {
        dp[i][j][0] = (dp[i - 1][j][1] + 1) % MOD;
        dp[i][j][1] = (dp[i - 1][j][0]) % MOD;
      } else {
        dp[i][j][0] = (1 + dp[i - 1][j][1] + dp[i][j - 1][0]) % MOD;
        dp[i][j][1] = (dp[i - 1][j][0] + dp[i][j - 1][0]) % MOD;
      }
    }
  }
  printf("%d\n", dp[n][n][0]);
}
