import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {
	
	public static long MOD = 1000000007;
	
	public static long mod_inv(long a, long m){
		return (a == 1 ? 1 : (1 - m*mod_inv(m%a, a)) / a + m);
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final int N = sc.nextInt();
		
		long fact = 1;
		for(int i = 1; i <= 2 * N; i++){
			fact *= i;
			fact %= MOD;
		}
		
		long div = 1;
		for(int i = 0; i < N; i++){
			div *= 2;
			div %= MOD;
		}
		
		System.out.println((fact * mod_inv(div, MOD)) % MOD);
	}
}