For this Question: Bob and Alice are playing a game with the following rules:

Initially, they have an integer sequence A1, A2, A3., An in addition, Bob has a lucky number 
a and Alice has a lucky number b.

The players alternate turns. In each turn, the current player must remove a non- zero number of elements from the sequence; each removed element should be a multiple of the lucky number of this player.

If it is impossible to remove any elements, the current player loses the game.
It is clear that one player wins the game after a finite number of turns. 

Find the winner of the game if Bob plays first and both Bob and Alice play optimally.First Line contains N , the Lucky Number of Bob and the Lucky Number of Alice
Second line contains a list of integersPrint a single line containing the string "ALICE" if the winner is Alice or "BOB" if the winner is Bob 
(without quotes).Input : 
5 3 2
 1 2 3 4 5

Output : Alice

Bob removes 3 and the sequence becomes [1, 2, 4, 5]. 
Then, Alice removes 2 and the sequence becomes [1, 4, 5]. 
Now, Bob is left with no moves, so Alice is the winner., I have written this Solution Code: def luckyNumberGame(nums, a, b):
    bobMoves = aliceMoves = commonMoves = 0
    for num in nums:
        if num%a == 0 and num%b == 0:
            commonMoves += 1
        elif num%a == 0:
            bobMoves += 1
        elif num%b == 0:
            aliceMoves += 1
            
    if commonMoves:
        bobMoves += 1
        
    if bobMoves > aliceMoves:
        return 'BOB'
    else:
        return 'ALICE'
            
, In this Programming Language: Python, Now tell me if this Code is compilable or not?