Determining the Winner in the String Difference Game

Alice and Bob are playing a game with two strings S and T of equal length. They compare the strings character by character. Let \(d\) be the number of positions where the characters differ, i.e., \(d = \sum_{i=1}^{n} \mathbf{1}_{S_i \neq T_i}\). If \(d\) is odd, then Alice wins; otherwise, Bob wins. Your task is to determine the winner given the two strings.

inputFormat

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

• The first line contains the string S.
• The second line contains the string T.

It is guaranteed that both strings have the same length.

outputFormat

Output a single line to standard output containing either Alice or Bob – the name of the winner.

Recall that if the total number of positions where the characters of S and T differ is odd, the winner is Alice; if even, the winner is Bob.

abc
bcx

Alice