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

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();

        if (n == 1) {
            System.out.println(0);
            return;
        }
        if (n == 2) {
            System.out.println(2);
            return;
        }

        System.out.println(combinations(4 * n - 4, 2 * (n - 2))
                .multiply(BigInteger.valueOf(n))
                .mod(BigInteger.valueOf(1_000_000_007)));
    }

    private static BigInteger combinations(int up, int down) {
        BigInteger val = BigInteger.ONE;

        for (int i = 0; i < down; i++) {
            val = val.multiply(BigInteger.valueOf(up - i));
        }

        for (int i = 1; i <= down; i++) {
            val = val.divide(BigInteger.valueOf(i));
        }

        return val;
    }

}