Alice vs Bob: Even-Odd Game

Alice and Bob are playing a game with a list of integers. The rules are simple: both players play optimally. In one move, a player can choose an integer from the list. Alice's objective is to force the final selected integer to be even, while Bob aims for an odd outcome. Since both play optimally:

• If there exists any even number in the list (i.e. a number of the form \(2k\)), then Alice can always choose that number to ensure an even final result, and she wins.
• If all numbers in the list are odd (i.e. of the form \(2k+1\)), then Bob will win.

Your task is to determine the winner, given the list of integers.

inputFormat

The input is given in two lines:

1. The first line contains a single integer \(n\) (\(1 \le n \le 10^5\)) representing the number of integers in the list.
2. The second line contains \(n\) space-separated integers.

outputFormat

Output a single line containing Alice if there is at least one even number in the list, otherwise output Bob.

3
1 2 3

Alice