# 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):
    if N == 1:
        ans = 1
    else:
        dp = [0] * (N + 1)
        dp[1] = 1
        for i in range(2, N + 1):
            inc = (2 * i - 1) * i
            dp[i] = (dp[i - 1] * inc) % MOD
        ans = dp[N] % MOD
    return ans


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


if __name__ == "__main__":
    main()