Tower Breakers Strike Back

In Tower Breakers Again, there are n towers of varying heights. A move consists of choosing a tower of height h and reducing it to a proper divisor of h (a divisor strictly less than h). The player who makes the last move wins. Determine the winner: return 1 if the first player wins, 2 if the second player wins.

Examples
Input: [2,4]
Output: 1
Hints

Tower Breakers Strike Back

In Tower Breakers Again, there are `n` towers of varying heights. A move consists of choosing a tower of height `h` and reducing it to a **proper divisor** of `h` (a divisor strictly less than `h`). The player who makes the last move wins. Determine the winner: return 1 if the first player wins, 2 if the second player wins.