In this game, Alice and Bob take turns removing stones from two piles. They can take 2i stones from one pile, discard i stones, and place the remaining i stones in the other pile. The player who can't perform this operation loses. Given X and Y stones in the initial piles, determine the winner if both players play optimally. Constraints: 0 ≤ X, Y ≤ 10^18. Input format: X Y. Output the winner: Alice or Bob.

# Buggy version:
a,b=[int(x) for x in input().split()]
if abs(a-b)<=1:
  	print("Brown):
else:
    print("Alice")

# Fixed version:
a,b=[int(x) for x in input().split()]
if abs(a-b)<=1:
  	print("Brown")
else:
  	print("Alice")

# Buggy version:
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()

def main():
    X, Y = map(int, input().split())
    """
    必勝法は「相手に山の差が１になるようにターンを渡すこと」
    そしたら相手がどんな操作をしてきても再び山の差を１にできるので、
    最終的には(0, 0), (0, 1), (1, 0)のどれかの状態を相手にわたすことになる。

    これどうやったら気づけるの？定常状態があるのがこの手の問題の定石？
    """
    if abs(X - Y) == 1:
        print("Brown")
    else:
        print("Alice")
    

if __name__ == "__main__":
    main()


# Fixed version:
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()

def main():
    X, Y = map(int, input().split())
    """
    必勝法は「相手に山の差が１になるようにターンを渡すこと」
    そしたら相手がどんな操作をしてきても再び山の差を１にできるので、
    最終的には(0, 0), (0, 1), (1, 0)のどれかの状態を相手にわたすことになる。

    これどうやったら気づけるの？定常状態があるのがこの手の問題の定石？
    """
    if abs(X - Y) <= 1:
        print("Brown")
    else:
        print("Alice")
    

if __name__ == "__main__":
    main()

# Buggy version:
n,m = map(int(input().split()))
if abs(n-m) < 2:
  print('Brown')
else:
  print('Alice')

# Fixed version:
n,m = map(int,input().split())
if abs(n-m) < 2:
  print('Brown')
else:
  print('Alice')

# Buggy version:
a,b=map(int,input().split())
cnt=1
if b>a:
    a,b=b,a
a=a-b
b=0
mod_a=a%3
if mod_a==2:
    print('Alice')
elif mod_a==1:
    print('Brown')
elif mod_a==0:
    print('Brown')
# if (mod_a==3)and(mod_b==3):
#     print('Alice')
# elif (mod_a==3)and(mod_b==1):
#     print('Alice')
# elif (mod_a==1)and(mod_b==3):
#     print('Alice')
# elif (mod_a==2)and(mod_b==0):
#     print('Alice')    
# elif (mod_a==0)and(mod_b==2):
#     print('Alice')
# else:
#     print('Brown')

# Fixed version:
a,b=map(int,input().split())
cnt=1
if abs(a-b)<=1:
    print('Brown')
else:
    print('Alice')


# if b>a:
#     a,b=b,a
# a=a-b
# b=0
# mod_a=a%3
# if a==3:
#     print('Alice')
# elif mod_a==2:
#     print('Alice')
# elif mod_a==1:
#     print('Brown')
# elif (mod_a==0)and(a!=3):
#     print('Brown')
# if (mod_a==3)and(mod_b==3):
#     print('Alice')
# elif (mod_a==3)and(mod_b==1):
#     print('Alice')
# elif (mod_a==1)and(mod_b==3):
#     print('Alice')
# elif (mod_a==2)and(mod_b==0):
#     print('Alice')    
# elif (mod_a==0)and(mod_b==2):
#     print('Alice')
# else:
#     print('Brown')

# Buggy version:
#一問目
x,y=map(int,input().split())
if abs(x-y)<=1:
    print("Blown")
else:
    print("Alice")

# Fixed version:
#一問目
x,y=map(int,input().split())
if abs(x-y)<=1:
    print("Brown")
else:
    print("Alice")

# Buggy version:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

X, Y = lr()

if abs(Y - X) >= 2:
    print('Alice')
else:
    print('Bob')

# 24

# Fixed version:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

X, Y = lr()

if abs(Y - X) >= 2:
    print('Alice')
else:
    print('Brown')

# 24

# Buggy version:
X,Y = map(int,input().split())

print("Alice" if abs(X-Y)>=1 else "Brown")

# Fixed version:
X, Y = map(int, input().split())
print("Alice" if abs(X-Y)>=2 else "Brown")

# Buggy version:
a,b = map(int,input())
print("ABlriocwen"[not abs(a-b)>1 :: 2])

# Fixed version:
a,b = map(int,input().split())
print("ABlriocwen"[not abs(a-b)>1 :: 2])

# Buggy version:
X,Y=map(int,input().split())
print('Alice' if abs(X-Y) < 2 else 'Brown')

# Fixed version:
X,Y = map(int,input().split())
print("Brown" if abs(X-Y)<2 else "Alice")

# Buggy version:
X,Y = map(int,input().split())

print("Alice" if abs(X-Y)>=1 else "Bob")


# Fixed version:
X, Y = map(int, input().split())
print("Alice" if abs(X- Y) > 1 else "Brown")

# Buggy version:
X,Y = map(int,input().split())
if X >= 2 and Y >= 2:
    print("Alice")
else:
    print("Brown")

# Fixed version:
X,Y = map(int,input().split())
if X > Y:
    X,Y = Y,X
if Y-X >= 2:
    print('Alice')
else:
    print('Brown')

# Buggy version:
x,y=map(int,input().split());print(['Alice','Blown'][abs(x-y)<2])


# Fixed version:
x,y=map(int,input().split());print(['Alice','Brown'][abs(x-y)<2])

# Buggy version:
x, y = map(int, input().split())

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

# Fixed version:
x, y = list(map(int, input().split()))

if abs(x-y) > 1:
    print('Alice')
else:
    print('Brown')

# Buggy version:
X,Y=map(int,input())
if max(X,Y)-min(X,Y) > 1:
  print("Alice")
else:
  print("Brown")

# Fixed version:
X,Y=map(int,input().split())
if max(X,Y)-min(X,Y) > 1:
  print("Alice")
else:
  print("Brown")

# Buggy version:
x,y = map(int,input().split())
if abs(x-y) <= 1:
  print("Alice")
else:
  print("Brown")

# Fixed version:
x,y= map(int,input().split())
if abs(x-y) > 1:
  print("Alice")
else:
  print("Brown")

# Buggy version:
X,Y = map(int,input().split(" "))

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



# Fixed version:
X,Y = map(int,input().split())
print('Brown' if abs(X-Y) <= 1 else 'Alice')

# Buggy version:
a,b=map(int,raw_input().split());print(abs(a-b)<2and'Brown'or'Alice')

# Fixed version:
a,b=map(int,input().split());print(abs(a-b)<2and'Brown'or'Alice')

# Buggy version:
a,b=map(int,input().split())

if abs(a-b)<2:
    print("Brown")
elif:
    print("Alice")

# Fixed version:
a,b=map(int,input().split())
 
if abs(a-b)<2:
    print("Brown")
else:
    print("Alice")

# Buggy version:
import numpy as np

Z = list(map(int,input().split()))
'''
print(X)
print(Y)
'''
Z = np.sort(Z)[::-1]
#print(Z)
count = 0
if Z[0]==1 or Z[0]==0:
    print ('Brown')
else:
    while Z[0] != 1:
        Z[1] += int(Z[0]/2)
        Z[0] -= int(Z[0]/2)*2
        Z = np.sort(Z)[::-1]
        count += 1
        print (Z)
    if (count%2) == 1:
        print ('Alice')
    else: print ('Brown')

# Fixed version:
import numpy as np

X,Y = list(map(int,input().split()))
'''
print(X)
print(Y)
Z = np.sort(Z)[::-1]
#print(Z)
count = 0
if Z[0]==1 or Z[0]==0:
    print ('Brown')
else:
    while Z[0] != 1:
        Z[1] += int(Z[0]/2)
        Z[0] -= int(Z[0]/2)*2
        Z = np.sort(Z)[::-1]
        count += 1
        print (Z)
    if (count%2) == 1:
        print ('Alice')
    else: print ('Brown')
'''

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

# Buggy version:
x, y = map(int, input().split())
print('Alice' if abs(x-y) else 'Brown')


# Fixed version:
x, y = map(int, input().split())
print('Brown' if abs(x-y) <= 1 else 'Alice')

# Buggy version:
x, y = map(int, input().split())
print('Alice' if abs(x-y) < 1 else 'Brown')


# Fixed version:
x, y = map(int, input().split())
if abs(x-y)<=1:
    print("Brown")
else:
    print("Alice")