import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		long t = System.currentTimeMillis();
		new Main().run();
		// new Thread(null, new Main(), "",
		// Runtime.getRuntime().maxMemory()).start();
		System.err.println(System.currentTimeMillis() - t);
	}

	long MODULO = 1_000_000_000 + 7;

	@SuppressWarnings("unchecked")
	public void run() {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		long[][] f = new long[N + 1][N + 1];
		// A(n-1)!=Nのとき
		for (int i = 1; i <= N; ++i) {
			f[N][i] = 1;
		}
		for (int pre = 1; pre <= N; ++pre) {
			for (int ne = 1; ne <= N; ++ne) {
				if (pre < ne + 1) {
					f[1][ne] += f[N][pre];
					f[1][ne] %= MODULO;
				}
			}
		}
		long[][] s = new long[N + 1][N + 1];
		for (int i = 1; i <= N; ++i) {
			s[1][i] = (f[1][i] + s[1][i - 1]) % MODULO;
		}
		for (int num = 2; num <= N - 1; ++num) {
			for (int ne = 1; ne <= N; ++ne) {// pre-num+1<ne,pre<ne+num-1
				f[num][ne] = s[num - 1][Math.min(ne + num - 2, N)];
			}
			for (int ne = 1; ne <= N; ++ne) {
				s[num][ne] = (f[num][ne] + s[num][ne - 1]) % MODULO;
			}
		}
		long ans = 0;
		for (int v = 1; v <= N; ++v) {
			ans = (ans + f[N - 1][v]) % MODULO;
		}
		for (int i = 0; i < f.length; ++i) {
			for (int j = 0; j < f.length; ++j) {
				f[i][j] = 0;
				s[i][j] = 0;
			}
		}
		f[N - 1][N] = 1;
		f[N][1] = 1;
		for (int v = 1; v <= N; ++v) {
			f[1][v] = 1;
			s[1][v] = (f[1][v] + s[1][v - 1]) % MODULO;
		}
		for (int num = 2; num <= N - 2; ++num) {
			for (int v = 1; v <= N; ++v) {
				f[num][v] = s[num - 1][Math.min(N, v + num - 2)];//v+num-1>pre
				s[num][v] = (s[num][v - 1] + f[num][v]) % MODULO;
			}
		}
		for (int v = 1; v <= N; ++v) {
			ans = (ans - f[N - 2][v] + MODULO) % MODULO;
		}
		System.out.println(ans);
	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}