#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long n;
long long dp[1010][1010];
long long rec(long long l, long long r) {
  if (dp[l][r] != -1) return dp[l][r];
  if (l == r)
    return dp[l][r] = rec(l, r - 1);
  else if (r == 0)
    return dp[l][r] = 1;
  else
    return dp[l][r] = (rec(l - 1, r) + rec(l, r - 1)) % MOD;
}
signed main() {
  cin >> n;
  long long ans = 0;
  for (long long i = 0; i != 1010; ++i)
    for (long long j = 0; j != 1010; ++j) dp[i][j] = -1;
  dp[1][0] = 1;
  for (long long s = 1; s < 2 * n; s += 2)
    for (long long i = 1 + s / 2; i <= s; ++i) {
      if (i > n) break;
      ans = (ans + rec(i, s - i)) % MOD;
    }
  cout << ans << endl;
  return 0;
}
