Problem:
 Score : 500 points    Problem Statement 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 .        Sample Input 1 2 1      Sample Output 1 Brown  Alice can do nothing but taking two stones from the pile containing two stones. As a result, the piles consist of zero and two stones, respectively. Then, Brown will take the two stones, and the piles will consist of one and zero stones, respectively. Alice will be unable to perform the operation anymore, which means Brown's victory.       Sample Input 2 5 0      Sample Output 2 Alice       Sample Input 3 0 0      Sample Output 3 Brown       Sample Input 4 4 8      Sample Output 4 Alice

Solution (Python):
print(["Alice","Brown"][-1<=eval(input().replace(*" -"))<=1])

Solution (Python):
X, Y = map(int, input().split())
if (Y%2==1 and (X+Y//2)%3==1) or (Y%2==0 and (X+Y//2)%3==0):
    if X==Y: print("Brown")
    else: print("Alice")
else:
    if abs(X-Y)==1: print("Brown")
    else: print("Alice")

Solution (Python):
x,y = map(int,input().split())
if(abs(x-y) < 2):
    print('Brown')
else:
    print('Alice')

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

Solution (Python):
print('ABlriocwen'[-2<eval(input().replace(*' -'))<2::2])

Solution (Python):


import sys
read = sys.stdin.read
readline = sys.stdin.readline

x,y = map(int,read().split())

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


"""
n = 10
dp = [[0]*n for _ in range(n)]
dp[0][0] = dp[0][1] = dp[1][0] = dp[1][1] = 2

for i in range(n):
    for j in range(i+1):
        I = i-j
        J = j
        assert I >= 0 and J >= 0
        if dp[I][J] != 0: continue

        for k in range(1,I//2+1):
            if dp[I-2*k][J+k]==2: dp[I][J] = 1
        for k in range(1,J//2+1):
            if dp[I+k][J-2*k]==2: dp[I][J] = 1
        if dp[I][J] == 0:
            dp[I][J] = 2
            

for i in dp:
    print(i)
"""

Solution (Python):
import sys

def S(): return sys.stdin.readline().rstrip()

X,Y = map(int,S().split())

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

Solution (Python):


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

if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int, input().split())
if abs(a-b)<=1:
  print('Brown')
else:
  print('Alice')

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

Solution (Python):
X,Y=map(int,input().split())
if abs(X-Y)<=1:
    print("Brown")
else:
    print("Alice")

Solution (Python):

A, B = map(int, input().split())
if abs(A-B)<=1:
    print("Brown")
else:
    print("Alice")

Solution (Python):
x,y=map(int,input().split())
if abs(x-y)>1:
  print('Alice')
else:
  print('Brown')

Solution (Python):
import sys
input = sys.stdin.readline
X, Y = map(int, input().split())
if abs(X - Y) <= 1: print("Brown")
else: print("Alice")

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

X,Y = map(int,read().split())

"""
from functools import lru_cache
import numpy as np
@lru_cache(None)
def solve_naive(X,Y):
    if X <= 1 and Y <= 1:
        return False
    for i in range(2,X+1,2):
        if not solve_naive(X - i, Y + i//2):
            return True
    for i in range(2,Y+1,2):
        half = i // 2
        if not solve_naive(Y - i, X + i//2):
            return True
    return False
A = np.zeros((16,16),np.int8)
for i in range(16):
    for j in range(16):
        A[i,j] = solve_naive(i,j)
print(A)
"""

if abs(X-Y) in [0,1]:
    print('Brown')
else:
    print('Alice')

Solution (Python):
X, Y = map(int, input().split())

if max(X, Y) <= 1:
    print('Brown')
    exit()

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

Solution (Python):
X,Y = map(int,input().split())
print('Alice' if abs(X-Y)>=2 else 'Brown')

Solution (Python):
def main():
    import sys
    
    X,Y = map(int,input().split())
    if abs(X-Y)<=1:
        print("Brown")
    else:
        print("Alice")
    
main()

Solution (Python):
def main():
    x, y = map(int, input().split())
    
    if x == y or abs(x - y) == 1:
        print("Brown")
    else:
        print("Alice")
    
        

if __name__ == '__main__':
    main()

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

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


if __name__ == '__main__':
    main()

Solution (Python):
x,y = map(int,input().split())

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

Solution (Python):
X,Y = [int(x) for x in input().split()]
if(abs(X-Y)<=1):
    print('Brown')
else:
    print('Alice')

Solution (Python):
X, Y = map(int, input().split())


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

Solution (Python):
A,B=map(int,input().split())
if abs(A-B)<=1:
  print("Brown")
else:
  print("Alice")

Solution (Python):
X, Y = map(int, input().split())
print("Brown" if max(X, Y) - min(X, Y) <= 1 else "Alice")

Solution (Python):
A, B = map(int, input().split())
if abs(A - B) <= 1:
    print("Brown")
else:
    print("Alice")

Solution (Python):
x,y = map(int,input().split())
ans = ["Alice","Brown"]
print(ans[abs(x-y)<2])

Solution (Python):

X,Y = map(int,input().split())

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

Solution (Python):
x,y=map(int,input().split())
print("Alice" if abs(x-y)>=2 else "Brown")

Solution (Python):

X, Y = map(int, input().split())


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


print(ans)

Solution (Python):
a,b=map(int,input().split())
print("Alice"if(abs(a-b)>1)else"Brown")

Solution (Python):
x,y = map(int, input().split())
if abs(x-y)<2:
    print("Brown")
else:
    print("Alice")

Solution (Python):
X, Y = list(map(int, input().split()))
if X == Y or abs(X - Y) == 1:
    print("Brown")
else:
    print("Alice")

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

Solution (Python):
x, y = map(int, input().split())
m = min(x, y)
x -= m
y -= m
if x == y:
    print("Brown")
else:
    if max(x, y) == 1:
        print("Brown")
    else:
        print("Alice")

Solution (Python):
a,b=map(int,input().split())
print(["Brown","Alice"][abs(a-b)>1])

Solution (Python):
x, y = map(int, input().split(' '))
if abs(x - y) >= 2:
    print("Alice")
else:
    print("Brown")

Solution (Python):
X,Y=map(int,input().split())
if abs(X-Y)<=1:
  print("Brown")
else:
  print("Alice")

Solution (Python):

a,b=map(int,input().split())
print('Alice' if abs(a-b)>1 else 'Brown')

Solution (Python):
X,Y = map(int,input().split())
print('Alice' if abs(X-Y) >= 2 else 'Brown')

Solution (Python):
import sys
stdin = sys.stdin

sys.setrecursionlimit(10**5)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

x,y = li()

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

Solution (Python):

x,y = map(int, input().split())

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

Solution (Python):
def inpl(): return [int(i) for i in input().split()]

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

Solution (Python):
a,b=map(int,input().split());print("Brown"if abs(a-b)<2 else"Alice")

Solution (Python):
a, b = map(int, input().split())
print('Alice' if abs(a - b) > 1 else 'Brown')

Solution (Python):
print(["Alice","Brown"][abs(eval(input().replace(" ","-")))<2])

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

Solution (Python):
X, Y = [int(_) for _ in input().split()]

cache = {}

def calc(X, Y):
    if X < Y:
        X, Y = Y, X
    def cal(X, Y):
        if X <= 1:
            return False
        for n in range(1, X // 2 + 1):
            if calc(X - n * 2, Y + n) == False:
                return True
        for n in range(1, Y // 2 + 1):
            if calc(X + n, Y - n * 2) == False:
                return True
        return False
    k = (X, Y)
    if k in cache:
        return cache[k]
    r = cal(X, Y)
    cache[k] = r
    return r

def calc1(X, Y):
    if abs(X - Y) < 2:
        return False
    return True

if calc1(X, Y):
    print("Alice")
else:
    print("Brown")

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

Solution (Python):

import sys
try: from typing import Any, Union, List, Tuple, Dict
except ImportError: pass
def debug(*args): print(*args, file=sys.stderr)
def exit(): sys.exit(0)


X, Y = map(int, input().split())
X, Y = max(X, Y), min(X, Y)

Alice = "Alice"
Brown = "Brown"

if X-Y <= 1:
    print(Brown)
    exit()
if X-Y == 2:
    print(Alice)
    exit()

if Y == 0:
    print(Alice)
    exit()

if ((X-Y) % 3 == 0) or ((X-Y) % 3 == 1):
    print(Alice)
    exit()

print(Brown)

Solution (Python):
x, y = map(int, raw_input().split())
print ['Alice', 'Brown'][abs(x - y) < 2]

Solution (Python):
print(['Alice','Brown'][abs(eval(input().replace(' ','-')))<2])

Solution (Python):
x, y = map(int, input().split())

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

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

Solution (Python):
import collections


def solve():
    x,y = map(int,input().split())
    if x-y == 0 or abs(x-y) == 1:
        print("Brown")
    else:
        print("Alice")

if __name__ == "__main__":
    solve()

Solution (Python):
x,y = map(int,input().split())
if x>y:
    x,y = y,x

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

Solution (Python):
if __name__=='__main__':
    m,n = map(int,input().split())
    if abs(m-n)>1:
        print('Alice')
    else:
        print('Brown')

Solution (Python):


X, Y = map(int, input().split())

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

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

Solution (Python):
X, Y = map(int, input().split())

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

Solution (Python):



xy = raw_input()
xy = xy.split()
x,y = map(int,xy)

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

Solution (Python):
def alice_brown():
	x, y = map(int, raw_input().split())
	
	
	
	if abs(x-y) <= 1:
		print "Brown"
	else:
		print "Alice"

if __name__ == "__main__":
	alice_brown()

Solution (Python):
X,Y = map(int,input().split())

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

Solution (Python):
x, y = map(int, raw_input().split())
print "Alice" if abs(x - y) > 1 else "Brown"

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

def main():
    a,b = LI()
    if abs(a-b) < 2:
        return 'Brown'

    return 'Alice'


print(main())

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

Solution (Python):
x, y = map(int, input().split())
print('Alice' if abs(x - y) >= 2 else 'Brown')

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

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

Solution (Python):
import sys
from functools import lru_cache

def solve():
    x, y = map(int, input().split())

    ans = 'Alice' if abs(x - y) >= 2 else 'Brown'

    print(ans)

if __name__ == '__main__':
    solve()

Solution (Python):
x,y=map(int,raw_input().split())

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

Solution (Python):


import sys
import os


X, Y = map(int, input().split())
if X < Y:
    X, Y = Y, X

diff = X - Y
if diff > 1:
    print('Alice')
else:
    print('Brown')

Solution (Python):
from sys import exit, setrecursionlimit
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

setrecursionlimit(1000000)

(x, y) = reads()

def Awin():
  print("Alice"); exit()

def Bwin():
  print("Brown"); exit()

if abs(x - y) <= 1:
  Bwin()
else:
  Awin()

Solution (Python):



import functools

@functools.lru_cache(maxsize = None)
def simulate(x, y):
    """ return True means first player wins """
    
    if x <= 1 and y <= 1:
        return False
    for i in range(1, x // 2):
        tmp = simulate(x - i * 2, y + i)
        if tmp == False:
            return True
    for i in range(1, y // 2):
        tmp = simulate(x + i, y - i * 2)
        if tmp == False:
            return True
    return False








def fast(X, Y):
    if X <= 2:
        if Y <= 3:
            return False
        else:
            return True
    elif X == 3:
        if Y <= 4:
            return False
        else:
            return True
    else:
        if X - 1 <= Y <= X + 1:
            return False
        else:
            return True

X, Y = map(int, input().split())
X, Y = min(X, Y), max(X, Y)
if fast(X, Y):
    print("Alice")
else:
    print("Brown")

Solution (Python):
x, y = input().split()
x, y = int(x), int(y)

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

Solution (Python):
x, y = map(int, input().split())
if x == y or x == y+1 or x == y-1:
    print('Brown')
else:
    print('Alice')

Solution (Python):
X, Y = list(map(int, input().split()))

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

Solution (Python):



def rl(s): return xrange(len(s))

INF = 2147483647


import sys
stdin = sys.stdin

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

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

Solution (Python):

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

Solution (Python):
a, b = map(int, input().split())
if abs(a-b) > 1:
  print("Alice")
else:
  print("Brown")

Solution (Python):

x, y = map(int, input().split())
x, y = sorted([ x, y ])
if x == y or x+1 == y:
    print('Brown')
else:
    print('Alice')

Solution (Python):
"""
def g(X, Y):
    s = set()
    for i in range(1,X/2):
        s.add(g(X-2*i,Y+i))
    for i in range(1,Y/2):
        s.add(g(X+i, Y-2*i))
    for i in range(100):
        if i not in s:
            return i

for X in range(16):
    for Y in range(16):
        print g(X,Y),
    print

0 0 0 0 1 1 2 2 3 3 4 4 5 5 6 6
0 0 0 0 1 1 2 2 3 3 4 4 5 5 6 6
0 0 0 0 1 1 2 2 3 3 4 4 5 5 6 6
0 0 0 0 0 1 2 2 3 3 3 4 4 5 5 6
1 1 1 0 0 0 1 1 4 3 5 4 6 4 5 5
1 1 1 1 0 0 0 1 2 2 2 5 6 6 7 5
2 2 2 2 1 0 0 0 1 1 2 4 3 7 6 8
2 2 2 2 1 1 0 0 0 1 2 3 3 3 3 4
3 3 3 3 4 2 1 0 0 0 1 1 2 2 5 4
"""

X,Y = map(int, raw_input().split())
print "Brown" if X<4 and Y<4 or abs(X-Y)<=1 else "Alice"

Solution (Python):
'''dp = [ [ -1 for i in range( 200 ) ] for j in range( 200 ) ]

def dfs( x, y ):
    global dp
    if dp[ x ][ y ] != -1:
        return dp[ x ][ y ]
    if x <= 1 and y <= 1:
        dp[ x ][ y ] = 0
        return dp[ x ][ y ]
    bag = set()
    for i in range( 2, x + 1, 2 ):
        bag.add( dfs( x - i, y + i // 2 ) )
    for i in range( 2, y + 1, 2 ):
        bag.add( dfs( x + i // 2, y - i ) )
    for i in range( 1000000 ):
        if not ( i in bag ):
            dp[ x ][ y ] = i
            return dp[ x ][ y ]

for i in range( 0, 100 ):
    for j in range( i, 100 ):
        if dfs( i, j ) == 0:
            print( i, j )'''

X, Y = map( int, input().split() )
if X > Y:
    X, Y = Y, X
if X == Y or X + 1 == Y:
    print( "Brown" )
else:
    print( "Alice" )

Solution (Python):
x, y = map(int, raw_input().split())
print"Alice"*(abs(x-y)>1)or"Brown"