#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
int n;
long long dp[2][1111];
int main() {
  int cur = 0;
  int pre = 1;
  dp[cur][2] = 1;
  cin >> n;
  long long ans = 1;
  for (int i = 2; i <= n; i++) {
    swap(cur, pre);
    memset(dp[cur], 0, sizeof(dp[cur]));
    for (int j = 2; j <= i; j++) {
      for (int k = 2; k <= j + 1; k++) {
        dp[cur][k] += dp[pre][j];
      }
    }
    for (int j = 2; j <= i + 1; j++) {
      dp[cur][j] %= mod;
      ans += dp[cur][j] * (j / 2);
      ans %= mod;
    }
  }
  cout << ans << endl;
  return 0;
}
