F. A word game
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Alice and Bob are playing the following game:

  • a word is written on paper in front of the players
  • in one move, a player can erase one letter, or two identical letters, or, all letters of the same type
  • players take turns
  • Alice is the first to start
  • it is the player, who erases the last letter, that wins.

Write a program that will determine the winner of the described above game for a given word (given that the players play optimally (successfully).

Input

The input contains a single line — the starting word. The word consists of capital Latin letters, and its length does not exceed 40 characters.

Output

Type "Alice" (without quotes) if Alice wins, or "Bob" (without quotes) if Bob wins.

Examples
Input
ZADACHA
Output
Alice
Input
WORD
Output
Bob
Note

For example, in the word "ZADACHA", Alice erases all the letters "A" by her first move. The word "Z.D.CH." remains, and she wins because, in subsequent moves, the players are forced to erase only one letter at a time.