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):
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):
X, Y = map(int, input().split())
print('Alice') if abs(X - Y) > 1 else print('Brown')

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

Solution (Python):
import sys
def main():
    def input():
        return sys.stdin.readline()[:-1]

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

if __name__ == '__main__':
    main()

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

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

Solution (Python):
X,Y=map(int,input().split())
A,B=X,Y
while A>=2 or B>=2:
    if A>B:
        a = A//2
        A-=2*a
        B+=a
    else:
        b = B//2
        B-=2*b
        A+=b
if X-Y == A-B:
    print("Brown")
else:
    print("Alice")

Solution (Python):
def main():

    X, Y = map(int, input().split())
    if X + Y <= 1: 
        return "Brown"
    elif abs(X-Y) <= 1: 
        return "Brown"
    else: 
        return "Alice"  

if __name__ == '__main__':
    print(main())

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):
x , y = map(int , input().split())
if abs(x - y) > 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("Brown" if abs(X - Y) < 2 else "Alice")

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    a = input().split()
    a = list(map(lambda x: x.capitalize(), a))
    a,b,c = a
    print(a[0]+b[0]+c[0])
    return


def B():
    a = II()
    b = II()
    if a > b:
        print("GREATER")
    if a < b:
        print("LESS")
    if a == b:
        print("EQUAL")
    return


def C():
    II()
    a = LI()
    def f(suma, b):
        for i in a[1:]:
            if suma * (suma + i) < 0:
                suma += i
                continue
            b += (abs(suma + i) + 1)
            suma = (-1 * (suma > 0)) or 1
        return b

    if a[0] == 0:
        ans = min(f(1, 1), f(-1, 1))
    else:
        ans = min(f(a[0], 0), f(1 * (a[0] < 0) or - 1, abs(a[0]) + 1))
    print(ans)
    return


def D_():
    s = S()
    for i in range(len(s) - 1):
        if s[i] == s[i+1]:
            print(i + 1, i + 2)
            return
    for i in range(len(s) - 2):
        if s[i] == s[i + 2]:
            print(i + 1, i + 3)
            return
    print(-1, -1)

def D():
    x, y = LI()
    a = abs(x - y)
    if a <= 1:
        print("Brown")
    else:
        print("Alice")
    return



if __name__ == '__main__':
    D()

Solution (Python):

import sys
INF = float("inf")


def solve(X: int, Y: int):

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


def main():

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


if __name__ == '__main__':
    main()

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

Solution (Python):



import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline 


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")
"""

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):
X, Y = map(int, input().split())

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

Solution (Python):
X,Y = (int(x) for x in input().split())

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

Solution (Python):
import sys
input=sys.stdin.readline
x,y=map(int,input().split())
g=max(x,y)-min(x,y)
if g==0 or g==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())
print("ABlriocwen"[abs(a-b)<=1::2])

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

Solution (Python):

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

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


if __name__ == '__main__':
    main()

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

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

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

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

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


if __name__ == "__main__":
    main()

Solution (Python):

import sys
sys.setrecursionlimit(300000)


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


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

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
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()))



@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











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):
x,y=map(int,input().split())
count=0
if abs(x-y)>1:
    print("Alice")
else:
    print("Brown")

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
from math import floor,ceil,sqrt,factorial
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    X, Y = MI()
    if abs(X - Y) <= 1:
        print("Brown")
    else:
        print("Alice")

if __name__ == '__main__':
    main()

Solution (Python):





from collections import* 
from fractions import gcd
from functools import* 
from itertools import* 
from operator import mul,itemgetter
from bisect import* 
from heapq import* 
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)


def main():
    a,b=map(int,input().split())
    if abs(a-b)>=2:
        print("Alice")
    else:
        print("Brown")
if __name__ == '__main__':
    main()

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())

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

Solution (Python):
X,Y = [ int(it) for it in input().split() ]
if ( abs(X-Y)//2 == 0 ):
  print ("Brown")
else:
  print ("Alice")

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math

mod = 10**9+7

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

if abs(X-Y) > 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())

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

Solution (Python):
x, y = [int(item) for item in input().split()]
if abs(x-y) > 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):
import sys

def main():
    input = sys.stdin.readline
    X, Y = map(int, input().split())

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


if __name__ == '__main__':
    print(main())

Solution (Python):
def alice_and_brown(X: int, Y: int)->str:
    return 'Alice' if abs(X-Y) > 1 else 'Brown'


if __name__ == "__main__":
    X, Y = map(int, input().split())
    ans = alice_and_brown(X, Y)
    print(ans)

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

Solution (Python):
import itertools
import math

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

if abs(x-y) >= 2:
    print("Alice")
else:
    print("Brown")

Solution (Python):
N,M=map(int,input().split())
if N + M <= 1:print("Brown")
elif abs(N-M)<= 1:print("Brown")
else:print("Alice")

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):
print('Brown' if abs(eval(input().replace(' ','-')))<=1 else 'Alice')

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

Solution (Python):



import sys  
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools



sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  
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 DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe
def dump(*args):
    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)


def local_input():
    from pcm.utils import set_stdin
    import sys
    from pathlib import Path
    parentdir = Path(os.path.dirname(__file__)).parent
    inputfile = parentdir.joinpath('test/sample-1.in')
    if len(sys.argv) == 1:
        set_stdin(inputfile)


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

if __name__ == "__main__":
    try:
        local_input()
    except:
        pass
    solve()

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

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

Solution (Python):

from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007






"""
n = I()
a = LI()
ans = 0
k = a[0]
for i in range(1,n):
    if k*(k+a[i]) >= 0:
        if k < 0:
            ans += abs(1-k-a[i])
            a[i] = 1-k
            k = 1
        else:
            ans += abs(-1-k-a[i])
            a[i] = -1-k
            k = -1
    else:
        k += a[i]
print(ans)
"""


x,y = LI()
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())
print("Brown" if abs(x-y)<=1 else "Alice")

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

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

print(ans)

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('Brown')
else:
    print('Alice')

Solution (Python):
X,Y = map(int,input().split())
print("Brown" if abs(X-Y)<2 else "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):
X,Y=map(int,input().split())
g=abs(X-Y)
if g<=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) == 0 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());print('BArloiwcne'[abs(x-y)>1::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())
print('Brown' if abs(X - Y) <= 1 else 'Alice')

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

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

Solution (Python):











X, Y = map(int, input().split())
if Y-1 <= 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):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def main():
    X, Y = map(int, input().split())

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


if __name__ == '__main__':
    main()

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

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

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

def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(ns())
def nf(): return float(ns())

x,y = li()

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

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

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

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

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

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

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

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

if X+Y <= 1 or (X == 1 and Y == 1):
  
  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("Brown")
else:
  print("Alice")

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

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

if abs(x-y)<=1:
    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())
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):
X,Y=map(int,input().split());print("Brown" if abs(X-Y)<=1 else "Alice")

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

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(X, Y):
    if abs(X-Y) > 1:
        return 'Alice'
    return 'Brown'


def main():
    X, Y = read_int_n()
    print(slv(X, Y))


if __name__ == '__main__':
    main()

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(X, Y):
    if abs(X-Y) > 1:
        return 'Alice'
    return 'Brown'


def main():
    X, Y = read_int_n()
    print(slv(X, Y))


if __name__ == '__main__':
    main()

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

if abs(x-y) > 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())

if X+Y <= 1:
  print('Brown')
  exit(0)

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

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

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())
if abs(X-Y)<=1:
        print("Brown")
else:
        print("Alice")

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

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

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

Solution (Python):
x,y = (int(i) for i in 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("Alice")
else:
  print("Brown")

Solution (Python):
x,y= map(int,input().split())
if abs(x-y) > 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())

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

Solution (Python):
def d_AliceBrown(X, Y):
    if abs(X - Y) <= 1:
        return 'Brown'
    else:
        return 'Alice'
    return None

X,Y = [int(i) for i in input().split()]
print(d_AliceBrown(X, Y))

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

Solution (Python):
x, y = list(map(int, input().split()))
if x==y or x+1 ==y or x == y+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):
X,Y=map(int,raw_input().split())
print "Brown" if abs(X-Y)<=1 else "Alice"

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

Solution (Python):
from collections import defaultdict


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


if __name__ == '__main__':
    main()

Solution (Python):
import sys





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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


solution = {}
choice = {}


def solve(x, y):
    if (x, y) in solution:
        return solution[(x, y)]
    for j in range(2, x + 1, 2):
        i = j // 2
        if not solve(x - 2 * i, y + i):
            res = True
            solution[(x, y)] = res
            choice[x, y] = x - 2 * i, y + i
            return res
    for j in range(2, y + 1, 2):
        i = j // 2
        if not solve(x + i, y - 2 * i):
            res = True
            solution[(x, y)] = res
            choice[x, y] = x + i, y - 2 * i
            return res
    res = False
    solution[(x, y)] = res
    return res


def solve2(x, y):
    return abs(x - y) >= 2


def test(N):
    for x in range(N):
        for y in range(N):
            if solve(x, y):
                print(x, y, '     ', choice[x, y])


def main():
    x, y = read_int_list()
    res = solve2(x, y)
    if res:
        print('Alice')
    else:
        print('Brown')



main()

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

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

Solution (Python):



A, B  = map(int, raw_input().split())

if abs(A - B) < 2:
	print("Brown")
else:
	print("Alice")

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

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

Solution (Python):


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

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

Solution (Python):
a = list(map(int,input().split(" ")))
if abs(a[0] - a[1]) < 2:
    print("Brown")
else:
    print("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):
a,b=map(int,input().split())
 
if abs(a-b)<2:
    print("Brown")
else:
    print("Alice")

Solution (Python):
kr=list(map(int,input().split()))
x,y=kr[0],kr[1]
if abs(x-y)==1 or abs(x-y)==0:
    print("Brown")
else:
    print("Alice")

Solution (Python):
import numpy as np

X,Y = list(map(int,input().split()))
'''
print(X)
print(Y)
Z = np.sort(Z)[::-1]

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')

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

Solution (Python):


if __name__ == "__main__":
    X, Y = map(int, raw_input().split(" "))

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

Solution (Python):
xy = list(map(int , input().split()))
x = xy[0]
y = xy[1]
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,raw_input().split())
if(abs(a-b)<=1):
      print 'Brown'
else:
      print 'Alice'

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

if (X-Y)**2 > 1:
    print("Alice")
else:
    print("Brown")

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