Factorisation game doubt

#1

can you please explain how the second test case works or any other example test case

#2

Hey @rohit_1906

First calculate total powers of all prime number in array. For example - in array [3 18 2 2] total powers of 2 will be 3 and powers of 3 will be 3. Now let me try to relate this problem with a classical game theory problem.

Let prime numbers are piles of stones and their total prime powers in array are equivalent to respective piles size. Now this has become a problem where two players are playing optimally and they reduce every pile to size 0. The last player unable to move loses.

I suggest you to read over internet about NIM game and let me know where you are stuck.
If this resolves your doubt mark it as resolved.