Taco Stone Game Winner

You are given n piles of stones. In each pile, there are a certain number of stones. Two players, Alice and Bob, play a game. The rule is simple:

Alice wins if and only if there exists at least one pile with more than one stone. In other words, if there exists an index \(i\) such that \(p_i > 1\), then Alice wins; otherwise, Bob wins.

Your task is to determine the winner given the initial configuration of the piles.

inputFormat

The input is read from standard input (stdin) and consists of two lines:

• The first line contains an integer \(n\) \( (1 \leq n \leq 10^5)\) representing the number of piles.
• The second line contains \(n\) space-separated integers \(p_1, p_2, \dots, p_n\) \( (1 \leq p_i \leq 10^9)\) indicating the number of stones in each pile.

outputFormat

Output a single line on standard output (stdout) containing the name of the winner: either Alice or Bob.

1
1

Bob