import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


enum MO = 1000000007L;

int N;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      if (N <= 2) {
        writeln(0);
      } else {
        auto dp = new long[][](N, N + 1);
        dp[0][] = 1;
        foreach (i; 1 .. N) {
          foreach (x; 0 .. N + 1 - i) {
            if (i % 2 == 0) {
              (dp[i][0] += dp[i - 1][x]) %= MO;
              (dp[i][x] -= dp[i - 1][x]) %= MO;
            } else {
              (dp[i][x] += dp[i - 1][x]) %= MO;
              (dp[i][N - i] -= dp[i - 1][x]) %= MO;
            }
          }
          foreach (x; 1 .. N + 1 - i) {
            (dp[i][x] += dp[i][x - 1]) %= MO;
          }
        }
        debug {
          if (N <= 10) {
            foreach (i; 0 .. N) {
              writeln(i, " ", dp[i]);
            }
          }
        }
        long ans = dp[N - 1][0];
        ans *= 2;
        ans = (ans % MO + MO) % MO;
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}