#include <bits/stdc++.h>
using namespace std;
const long long mod = (1e9 + 7);
pair<long long, bool> dp[1005][1005];
int main() {
  int n;
  while (cin >> n) {
    for (int i = 0; i <= n; i++) {
      for (int j = i; j <= n; j++) {
        long long tf1 = i >= 1 ? dp[i - 1][j].first : 0;
        bool tb1 = i >= 1 ? dp[i - 1][j].second : false;
        long long tf2 = i <= j - 1 ? dp[i][j - 1].first : 0;
        bool tb2 = i <= j - 1 ? dp[i][j - 1].second : false;
        dp[i][j].first = tf1 + tf2 + ((tb1 || tb2) ? 1 : 0);
        dp[i][j].first %= mod;
        dp[i][j].second = !(tb1 || tb2);
      }
    }
    cout << dp[n][n].first << endl;
  }
  return 0;
}
