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
# coding: utf-8
# Your code here!

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意

#n = int(input())
x,y = [int(i) for i in readline().split()]

if abs(x-y) <= 1:
    print("Brown")
else:
    print("Alice")

"""
n = 50
dp = [[0]*n for i in range(n)]

dp[1][1] = -1 

def dfs(i,j):
    if dp[i][j] != 0: return dp[i][j]
    for k in range(1,i//2+1):
        if dfs(i-2*k,j+k) == -1:
            dp[i][j] = 1
            return 1
    for k in range(1,j//2+1):
        if dfs(i+k,j-2*k) == -1:
            dp[i][j] = 1
            return 1
    dp[i][j] = -1
    return -1
        
for i in range(10):
    for j in range(10):
        dfs(i,j)


print(*dp, sep="\n")
"""