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][N];
		for (int i = 1; i <= N; ++i) {
			f[i][i][0] = 1;
		}
		for (int t = 1; t < N; ++t) {
			for (int a1 = 1; a1 <= N; ++a1) {
				for (int nak = 1; nak <= N; ++nak) {
					for (int x = 1; x <= Math.min(nak + t - 1, N); ++x) {
						f[a1][nak][t] += f[a1][x][t - 1];
						f[a1][nak][t] %= MODULO;
					}
				}
			}
		}
		long ans = 0;
		for (int a0 = 1; a0 <= N; ++a0) {
			for (int nak = 1; nak <= N; ++nak) {
				if (nak < a0 + 1) {
					ans = (ans + f[a0][nak][N - 1]) % MODULO;
				}
			}
		}
		System.out.println(ans);
	}

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