#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
const long long MOD = 1e9 + 7;
int n, f[N][N];
void dfs(int x, int y) {
  if (f[x][y] != -1) return;
  if (x > n || y > x) {
    f[x][y] = 0;
    return;
  }
  dfs(x + 1, y);
  dfs(x, y + 1);
  f[x][y] = f[x + 1][y] + f[x][y + 1];
  if ((x + y) % 2) f[x][y] += 1;
  f[x][y] %= MOD;
}
int main() {
  scanf("%d", &n);
  memset(f, -1, sizeof(f));
  dfs(1, 0);
  printf("%d", f[1][0]);
  return 0;
}
