You are given two positive integers x and y, representing the number of coins of value $75$ and $10$, respectively.

Alice and Bob play a game where Alice takes the first turn. In each turn, a player must pick a combination of coins that sums to a value of $115$. This requires choosing $1$ coin of value $75$ and $4$ coins of value $10$.

The player who cannot make a valid move on their turn loses the game.

Assuming both players play optimally, return the name of the winning player, either "Alice" or "Bob".

Constraints:

• $1 \leq$ x, y $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.