Solution in Python 3 (beats 100.00%) (one line)
```\nfrom math import factorial as f\nfrom bisect import bisect_right as br\n\nclass Solution:\n    def numPrimeArrangements(self, n: int) -> int:\n    \treturn
```\nfrom math import factorial as f\nfrom bisect import bisect_right as br\n\nclass Solution:\n    def numPrimeArrangements(self, n: int) -> int:\n    \treturn (lambda x:(f(x)*f(n-x))%(10**9+7))(br([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\n\n- Junaid Mansuri\n(LeetCode ID)@hotmail.com
['Python', 'Python3']