import java.util.Scanner;

public class Main {
	static final int MAX = 2000005;
    static final int MOD = 1000000007;
    static long[]fact = new long[MAX];
    static long[]factInv = new long[MAX];
    static long[]inv = new long[MAX];
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		scan.close();
		factMOD();
        invMOD();
        factInvMOD();
        long sum = 0;
        for(int i = 1; i <= N; i++) {
        	sum += combMOD(8 + i, i);
        	sum = sum % MOD;
        }
        sum = sum + 1;
        sum = sum % MOD;
        System.out.println(sum);

	}
	static void factMOD() {
        fact[0] = 1;
        for(int i = 1; i < MAX; i++) {
            fact[i] = fact[i - 1] * i % MOD;
        }
    }
    static void invMOD() {
        inv[0] = 1;
        inv[1] = 1;
        for(int i = 2; i < MAX; i++) {
            inv[i] = MOD - inv[(int)(MOD % i)] * (MOD / i) % MOD;
        }
    }
    static void factInvMOD() {
        factInv[0] = 1;
        for(int i = 1; i < MAX; i++) {
            factInv[i] = factInv[i - 1] * inv[i] % MOD;
        }
    }
    static long combMOD(int n, int k) {
        if(n < k) return 0;
        if(n < 0 || k < 0) return 0;
        return fact[n] * ((factInv[k] * factInv[n - k]) % MOD) % MOD;
    }
}