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):
a,b=[int(x) for x in 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 X<Y:
    X,Y=Y,X
    
print('Brown' if (X-1<=Y and Y<=X+1) else '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())
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
def MI(): return map(int,sys.stdin.readline().rstrip().split())


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

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  
def LS2(): return list(sys.stdin.readline().rstrip())  


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

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

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache





MOD = 10**9+7
INF = float('inf')
AZ = "abcdefghijklmnopqrstuvwxyz"






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]



def DD(arg): return defaultdict(arg)


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n): return kaijo_memo[n]
  if(len(kaijo_memo) == 0): kaijo_memo.append(1)
  while(len(kaijo_memo) <= n): kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n): return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0): gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n): gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if n == r: return 1
  if n < r or r < 0: return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1: arr.append([temp, 1])
  if arr==[]: arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b: a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n-1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n: return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

def base_10_to_n_without_0(X, n):
  X -= 1
  if X//n: return base_10_to_n_without_0(X//n, n)+[X%n]
  return [X%n]


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count





X,Y = IL()
if abs(X-Y)>=2:
  print("Alice")
else:
  print("Brown")

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

if X+Y<=1:
    print("Brown")

else:
    n=X-Y
    if n<0:
        n=(-1)*n
    
    if n<=1:
        print("Brown")
    else:
        print("Alice")

Solution (Python):
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]

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 -1 <= 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("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):
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()

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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









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

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




def RD(): return input().rstrip().decode()
def II(): return int(input())
def FI(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))



def main():
	x,y=MI()
	a=abs(x-y)
	print("Brown" if a<=1 else "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):













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

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

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

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
from math import sqrt, pi
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7





X, Y = getNM()
X = int(X)
Y = int(Y)

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

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

Solution (Python):
import sys

def main():
    x,y=map(int,input().split())
    s=2*x+y
    t=2*y+x
    if s//3-(s%3==0)==t//3-(t%3==0):
        print('Brown')
    else:
        print('Alice')

if __name__=='__main__':
    main()

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

Solution (Python):
X,Y = map(int, open(0).read().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())
if abs(x-y)<=1:
  print("Brown")
else:
  print("Alice")

Solution (Python):

printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split()) 
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7


def ddprint(x):
  if DBG:
    print(x)

x,y = inm()
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):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

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

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

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

Solution (Python):
x,y=map(int, input().split())
print("Brown"if abs(x-y)<2else"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())
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, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce, lru_cache
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
mod = 10 ** 9 + 7

X, Y = MAP()
if abs(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):
import sys
input = sys.stdin.readline
from collections import *

def dfs(x, y):
    res = False
    
    for i in range(2, x+1, 2):
        res |= not dfs(x-i, y+i//2)
    
    for i in range(2, y+1, 2):
        res |= not dfs(x+i//2, y-i)
    
    return res

"""
for i in range(5):
    for j in range(5):
        print(dfs(i, j), end=' ')
    print()
"""

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

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):


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

    def solve(x, y):
        """手番が勝つか"""
        return not ((X + Y <= 1) or (abs(X - Y) <= 1))

    cond = solve(X, Y)
    print('Alice' if cond else 'Brown')


if __name__ == '__main__':
    main()

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    x, y = mi()
    print('Brown') if abs(x - y) <= 1 else print('Alice')


if __name__ == "__main__":
    main()

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

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy


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' if abs(X - Y) > 1 else 'Brown')

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

Solution (Python):
import sys
input = sys.stdin.readline
from collections import *

"""
def dfs(x, y):
    if x<=1 and y<=1:
        return False
    
    res = False
    
    for i in range(2, x+1, 2):
        res |= not dfs(x-i, y+i//2)
    
    for i in range(2, y+1, 2):
        res |= not dfs(x+i//2, y-i)
    
    return res

for i in range(5):
    for j in range(5):
        print(dfs(i, j), end=' ')
    
    print()
"""

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

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())
X,Y=max(X,Y),min(X,Y)


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

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)>=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):
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):
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
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))





X,Y = LI()
if abs(X-Y) == 1 or abs(X-Y) == 0:
    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, input().split())

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

Solution (Python):

import io

nim,mike = map(int,input().split())
print("Brown" if abs(nim-mike)<2 else "Alice")

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


if result <=1:
    print("Brown")
else:
    print("Alice")

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

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

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


if __name__ == '__main__':
    solve()

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

Solution (Python):

import sys


def solve(X: int, Y: int):
    return 'Alice' if abs(X-Y) > 1 else 'Brown'



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))  
    print(solve(X, Y))

if __name__ == '__main__':
    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("Brown")
else:
    print("Alice")

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

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

print(ans)

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

Solution (Python):
import sys
def main():
    input = sys.stdin.readline
    X,Y = map(int, input().split())
    if X>Y: X,Y = Y,X

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys

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

    return 0

if __name__ == "__main__":
    solve()

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('Brown' if abs(x - y) <= 1 else 'Alice')

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    x,y=MI()
    
    if abs(x-y)<=1:
        print("Brown")
    else:
        print("Alice")
                

main()

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

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

Solution (Python):

import sys


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


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

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("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):
import sys

sys.setrecursionlimit(10 ** 6)
def MI(): return map(int, sys.stdin.readline().split())

def main():
    x,y=MI()
    if x>y:x,y=y,x
    if y>x+1:print("Alice")
    else:print("Brown")

main()

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) <= 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):
import sys
input = sys.stdin.readline

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

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

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

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

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

X, Y = MAP()

memo = list2d(1007, 1007, -1)
def rec(x, y):
    if memo[x][y] != -1:
        return memo[x][y]
    if x < 2 and y < 2:
        memo[x][y] = 0
        return 0
    res = 0
    for i in range(2, x+1):
        if not rec(x - i, y + i//2):
            res = 1
    for i in range(2, y+1):
        if not rec(x + i//2, y - i):
            res = 1
    memo[x][y] = res
    return res







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

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

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

Solution (Python):
import sys

x, y = map(int, sys.stdin.readline().split())

def main():
    return  'Brown' if abs(x - y) <= 1 else 'Alice'

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

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

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

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


if __name__ == "__main__":
    main()

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 (X - Y) ** 2 > 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 print('Brown')

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

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

Solution (Python):
x,y=[int(i) for i in 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):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    x,y=map(int,input().split())
    print("Alice" if(abs(x-y)>1) else "Brown")
resolve()

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

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

Solution (Python):
def examD():
    X, Y =LI()
    if abs(X-Y)<=1:
        ans = "Brown"
    else:
        ans = "Alice"
    print(ans)

import sys
import copy
import bisect
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examD()

Solution (Python):
x, y = [int(i) for i in input().split()]

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

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

Solution (Python):
X,Y = 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) < 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):
print(['Alice','Brown'][abs(eval(input().replace(' ','-')))<2])

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

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