human
Can you provide a Python code to determine the winner of the game, assuming that both players play optimally given the following:
Alice and Brown loves games. Today, they will play the following game.

In this game, there are two piles initially consisting of X and Y stones, respectively. Alice and Bob alternately perform the following operation, starting from Alice:

* Take 2i stones from one of the piles. Then, throw away i of them, and put the remaining i in the other pile. Here, the integer i (1≤i) can be freely chosen as long as there is a sufficient number of stones in the pile.


The player who becomes unable to perform the operation, loses the game.

Given X and Y, determine the winner of the game, assuming that both players play optimally.

Constraints

* 0 ≤ X, Y ≤ 10^{18}

Input

Input is given from Standard Input in the following format:

X Y

Output

Print the winner: either `Alice` or `Brown`.

Examples

Input

2 1

Output

Brown

Input

5 0

Output

Alice

Input

0 0

Output

Brown

Input

4 8

Output

Alice
assistant
#Here is Python code to determine the winner of the game, assuming that both players play optimally.

#!/usr/bin/env python3
import sys

def solve(X: int, Y: int):
    print("Brown" if -1 <= X - Y <= 1 else "Alice")

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    Y = int(next(tokens))  # type: int
    solve(X, Y)

if __name__ == '__main__':
    main()