AT_past202303_a シンプル石取りゲーム

Alice and Bob play a game. Initially, the pile has $ N $ stones. The two players alternately remove one stone from the pile. If $ S $ is $ 0 $ , Alice goes first; if it is $ 1 $ , Bob goes first. If $ T $ is $ 0 $ , the player who removes the last stone wins; if it is $ 1 $ , the player who removes the last stone loses (and the other player wins). Determine which player will win.

The input is given from Standard Input in the following format: > $ N $ $ S $ $ T $

Print `Alice` if Alice will win; print `Bob` if Bob will win.

### Sample Explanation 1 The game starts with Alice going first. - The pile has initially $ 3 $ stones. - Alice removes one stone from the pile. The pile has $ 2 $ remaining stones. - Bob removes one stone from the pile. The pile has $ 1 $ remaining stone. - Alice removes one stone from the pile. She loses because she has removed the last stone. ### Sample Explanation 2 The game starts with Bob going first. - The pile has $ 2 $ stones. - Bob removes one stone from the pile. The pile has $ 1 $ remaining stone. - Alice removes one stone from the pile. She wins because she has removed the last stone. ### Constraints - $ 1 \leq N \leq 100 $ - $ N $ is an integer. - $ S $ is $ 0 $ or $ 1 $ , and so is $ T $ .