EZ Python Solution for Bruddas
\nimport math\nclass Solution:\n    def numPrimeArrangements(self, n: int) -> int:\n        primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53
```\nimport math\nclass Solution:\n    def numPrimeArrangements(self, n: int) -> int:\n        primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]\n        \n        primesn = []\n        \n        if(n==2):\n            return 1\n        for i in range(len(primes)):\n            if(primes[i]<=n):\n                primesn.append(primes[i])\n        \n        \n        return (math.factorial(len(primesn))*math.factorial(n-len(primesn))) % (10**9 + 7)\n       ```
[]