#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long long int dp[1001][1001][2];
long long int foo(long long int l, long long int r, int f) {
  if (l > r) return 0;
  if (dp[l][r][f]) return dp[l][r][f];
  if (r == 1 && l == 0) return 1 - f;
  if (l > 0) {
    if (f) {
      dp[l][r][f] = (foo(l - 1, r, 0) + foo(l, r - 1, 0)) % mod;
    } else {
      dp[l][r][f] = (1 + foo(l - 1, r, 1) + foo(l, r - 1, 1)) % mod;
    }
  } else {
    if (f) {
      dp[l][r][f] = foo(l, r - 1, 0);
    } else {
      dp[l][r][f] = (1 + foo(l, r - 1, 1)) % mod;
    }
  }
  return dp[l][r][f];
}
int main() {
  ios::sync_with_stdio(false);
  long long int n;
  cin >> n;
  cout << foo(n, n, 1) << '\n';
  return 0;
}
