# coding: utf-8
import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    N = II()
    return (N,)


def solve(N):
    l_sum = [0] * (N + 1)
    dp = [0] * (N + 1)
    for i in range(1, N + 1):
        if i == 1:
            l_sum[1] = 1
            dp[1] = 1
            continue
        l_sum[i] = l_sum[i - 1] + (2 * i - 2) + (2 * i - 1)
        dp[i] = dp[i - 1] * l_sum[i]
    ans = dp[N] % MOD
    return ans    


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()