import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	final long MOD = 1_000_000_000 + 7;
	long[] fac = new long[400001];
	long[] inv = new long[400001];
	long[] ifac = new long[400001];
	long[] catalan = new long[100001];
	{
		fac[0] = fac[1] = inv[0] = inv[1] = ifac[0] = ifac[1] = 1;
		for (int i = 2; i < fac.length; ++i) {
			fac[i] = i * fac[i - 1] % MOD;
			inv[i] = (MOD - (MOD / i) * inv[(int) (MOD % i)] % MOD);
			ifac[i] = inv[i] * ifac[i - 1] % MOD;
		}
		catalan[0] = 1;
		for (int i = 1; i <= 200000 / 2 - 1; ++i) {
			catalan[i] = ((comb(2 * i, i) - comb(2 * i, i - 1) + MOD) % MOD);
		}
	}

	long comb(int n, int k) {
		return fac[n] * ifac[k] % MOD * ifac[n - k] % MOD;
	}

	public void run() {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		long ans = 0;
		for (int i = 0; i <= N / 2; ++i) {
			ans = (ans + comb(N + 2 * i, i));
		}
		long sum = 0;
		for (int i = N / 2 - 1; i >= 0; --i) {
			sum = (sum + catalan[i]) % MOD;
		}
		for (int i = 0; i <= N / 2; ++i) {
			ans = (ans - 2 * comb(N + 2 * i, i) * sum % MOD + MOD) % MOD;
			if (i != N / 2)
				sum = (sum - catalan[N / 2 - i - 1] + MOD) % MOD;
		}
		System.out.println(ans);
	}

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