#C2345. Determine the Winner in the String Transformation Game

    ID: 45651 Type: Default 1000ms 256MiB

Determine the Winner in the String Transformation Game

Determine the Winner in the String Transformation Game

Alice and Bob are playing a game based on string transformation. They are given a non-empty string \(s\) consisting of lowercase English letters. The rule is simple: if the string \(s\) contains more than one unique character, then Alice can make the first move and force a win. However, if all the characters in the string are identical, then Alice cannot make a valid move and Bob wins.

Your task is to determine the winner based on the initial string \(s\). In other words, output "Alice" if the string has at least two distinct characters; otherwise, output "Bob".

inputFormat

The input is provided via standard input and consists of a single line containing the string \(s\), which is composed of lowercase English letters only.

outputFormat

Output a single line to standard output containing the winner's name: either "Alice" or "Bob".

## sample
abacd
Alice