#K1381. Chocolate Bar Game

    ID: 23995 Type: Default 1000ms 256MiB

Chocolate Bar Game

Chocolate Bar Game

In this problem, you are given the dimensions of a chocolate bar, represented by two integers ( m ) and ( n ). Two players, Alice and Bob, play a game. The rules are simple: if both ( m ) and ( n ) are odd (i.e., ( m \bmod 2 = 1 ) and ( n \bmod 2 = 1 )), then Bob wins; otherwise, Alice wins. Your task is to determine the winner based on these rules.

inputFormat

The input is provided via standard input (stdin) and consists of a single line containing two space-separated integers ( m ) and ( n ), which represent the dimensions of the chocolate bar. You can assume that ( 1 \leq m, n \leq 10^9 ).

outputFormat

Output a single string to standard output (stdout): output "Bob" if both ( m ) and ( n ) are odd; otherwise, output "Alice".## sample

3 2
Alice