# 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):
    n_div, n_mod = divmod(N, 10 ** 6)
    l_mod = [1, 975701239, 694465021, 819045129, 390946736, 18892601, 778494515, 729453757, 665093464, 846684919, 260624814]
    now_mod = l_mod[n_div]
    for n in range(n_div * 10 ** 6 + 1, N + 1):
        now_mod = (now_mod * n * (2 * n - 1)) % MOD
    
    ans = now_mod
    return ans


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


if __name__ == "__main__":
    main()