Chessboard Game

Problem Description

Given an $n \times n$ chessboard with a single stone placed at some position. Two players take turns moving the stone. In each turn, a player may move the stone one cell up, down, left, or right, but the destination cell must never have been visited before. The player who cannot make a move loses.

The first player moves first, and both players play optimally. If the first player wins, output Alice; otherwise output Bob.

Input Format

The first line contains an integer $n$, the size of the board.

The second line contains two integers $x, y$, the initial position of the stone.

Output Format

Print one line containing a single string: Alice or Bob.

Sample Input

2
1 1

Sample Output

Alice

Constraints

• $1 \le n \le 10^4$
• $1 \le x, y \le n$