#include <bits/stdc++.h>
using namespace std;
const int maxN = 1010;
long long dp[maxN][maxN];
const long long mod = 1e9 + 7;
bool vis[maxN][maxN];
void output(int n) {
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      printf("%lld ", dp[i][j]);
    }
    puts("");
  }
}
int main() {
  int n;
  scanf("%d", &n);
  n++;
  dp[0][1] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod;
  long long ans = 0;
  for (int i = n; i >= 1; i--)
    for (int j = n; j >= i; j--) {
      if (!vis[i][j] && !vis[i + 1][j] && i + 1 <= n && i + 1 <= j) {
        ans = (ans + dp[i][j]) % mod;
        vis[i][j] = true;
      }
      if (!vis[i][j] && !vis[i][j + 1] && j + 1 <= n) {
        ans = (ans + dp[i][j]) % mod;
        vis[i][j] = true;
      }
    }
  cout << ans << endl;
  return 0;
}
