MOD = 10**9 + 7

calc_primes = lambda n: (
    (
        lambda ans: [
            ans.append(i)
            for i in range(2, n + 1)
            if not [j for j in ans if i % j == 0]
        ] is None or ans
    )([])
)

factorial = (lambda n: (
        lambda ans: [ans := (ans * i) % MOD for i in range(1, n + 1)] is None or ans
    )(1)
)

class Solution:
    def numPrimeArrangements(self, n: int) -> int:
        return (
            lambda n, num_primes, factorial: factorial(num_primes) * factorial(n - num_primes) % MOD
        )(
            n,
            len(calc_primes(n)),
            factorial
        )