Miller-Rabin primality test

Determine whether a 64-bit integer n is prime using deterministic Miller-Rabin (a fixed set of bases suffices for n < 2^64). Return True/False. Constraints: 0 <= n < 2^63. Handle 0, 1, and small primes correctly. Trial division alone would be far too slow for n near 10^18.