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
import os
import sys
from functools import lru_cache

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

X, Y = list(map(int, sys.stdin.readline().split()))


# @debug
@lru_cache(maxsize=None)
def grundy(x, y):
    if (x, y) in [(0, 1), (1, 0), (1, 1)]:
        return 0

    gs = set()
    for i in range(2, x + 1, 2):
        gs.add(grundy(x - i, y + i // 2))
    for i in range(2, y + 1, 2):
        gs.add(grundy(x + i // 2, y - i))
    ret = 0
    while ret in gs:
        ret += 1
    return ret


# for i in range(100):
#     for j in range(100):
#         print(i, j, grundy(i, j))

# if grundy(X, Y):
#     print('Alice')
# else:
#     print('Brown')

if abs(X - Y) <= 1:
    print('Brown')
else:
    print('Alice')
