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; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

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 = 10L^^9 + 7;

int N;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      long ans;
      // A[N] = 1 or A[N] > 1
      foreach (s; 0 .. 2) {
        auto dp = new long[N + 1];
        auto dpSum = new long[N + 2];
        if (s == 0) {
          dp[1] = 1;
        } else {
          dp[2 .. N + 1] = 1;
        }
        // A[N] < A[1] + 1
        // A[i - 1] < A[i] + (i - 1)
        foreach (i; 1 .. N) {
          foreach (j; 1 .. N + 1) {
            dpSum[j + 1] = (dpSum[j] + dp[j]) % MO;
          }
          const k = (i == 1) ? 1 : (i - 1);
          foreach (j; 1 .. N + 1) {
            dp[j] = dpSum[min(j + k, N + 1)];
          }
        }
        // (A[N - 1], A[N]) != (N, 1)
        foreach (j; 1 .. N + 1) {
          if (!(s == 0 && j == N)) {
            (ans += dp[j]) %= MO;
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}