def my_pow(a, b, mod):
	res = 1
	while b > 0:
		if int(b) & 1:
			res = res * a % mod
		a = a ** 2 % mod
		b /= 2

	return int(res)

def comb(n, r, mod):
	N = 1
	for i in range(r): N = N * (n - i) % mod
	R = 1
	for i in range(r): R = R * (i + 1) % mod
	R = my_pow(R, mod - 2, mod)

	return int(N * R % mod)

def solve():
	n = int(input())
	mod = 1000000007
	goods = comb(2 * n, n, mod) - comb(2 * n, n - 1, mod)
	if goods <= 0: goods += mod
	people = 1
	for i in range(n):
		people *= (i + 1)
		people %= mod
	people = people ** 2 % mod

	print(int(goods * people % mod))

if __name__ == "__main__":
	solve()