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-----
2 1

-----Sample Output-----
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.

Difficulty: interview

Starter code:

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

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

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

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

# abs(x - y) <= 1 → abs(x - y) >= 2
# abs(x - y) >= 2 → abs(x - y) <= 1


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


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

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

print(ans)


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


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

X,Y=list(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")


import sys

def main():
    x,y=list(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')

def __starting_point():
    main()

__starting_point()

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

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


#!/usr/bin/env python3
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))  # type: int
    Y = int(next(tokens))  # type: int
    solve(X, Y)


def __starting_point():
    main()

__starting_point()

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

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

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

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


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

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

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

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

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

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


def __starting_point():
    solve()

__starting_point()

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

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

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


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

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


def __starting_point():
    main()
__starting_point()

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

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

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

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

# -*- coding: utf-8 -*-

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

# for i in range(X+1):
#     for j in range(Y+1):
#         rec(i, j)
# for i in range(X+1):
#     print(memo[i][:Y+1])

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


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

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

def main():
    X,Y = list(map(int,input().split()))
    if abs(X - Y) <= 1:
        print('Brown')
    else:
        print('Alice')
def __starting_point():
    main()

__starting_point()

# 解説AC
X,Y = map(int, input().split())
print("Alice" if abs(X - Y) > 1 else "Brown")

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


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


X,Y = map(int, open(0).read().split())
if abs(X-Y) <= 1:
    print('Brown')
else:
    print('Alice')

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

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

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

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

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


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

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

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

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

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

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

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

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

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


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

if X >= Y+2:
  print('Alice')
elif X <= Y-2:
  print('Alice')
else:
  print('Brown')

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


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

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


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

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

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

X,Y=list(map(int,input().split()))
if X+Y<2 or abs(X-Y)<2: print("Brown")
else : print("Alice")


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

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


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

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

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

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

import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


def solve():
    x, y = inl()
    if x > y:
        x, y = y, x
    d = y - x
    if d <= 1:
        return False
    return True


print("Alice" if solve() else "Brown")


x,y = list(map(int,input().split()))
if abs(x-y) <= 1:
    print("Brown")
else:
    print("Alice")
# a:x+y >1 , abs(x-y)>1
# b:x+y >1 , abs(x-y) <=1
# c:x+y <=1, (abs(x-y) <=1  )　--> lose
#
#       c <--- a <---> b
#       a <---> a


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 list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def ZIP(n): return list(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")


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

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

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

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

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

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

def __starting_point():
    solve()
__starting_point()

x,y=map(int,input().split())
print("BArloiwcne"[abs(x-y)>1::2])

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

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

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

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


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

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


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

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

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


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


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

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


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

# solution
import io

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

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

a,b=list(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')


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

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

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

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

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

def __starting_point():
    main()
__starting_point()

#!/usr/bin/env python3
import sys


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    Y = int(next(tokens))  # type: int
    print((solve(X, Y)))

def __starting_point():
    main()

__starting_point()

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

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

# editorial

def main():
    X, Y = list(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'))


def __starting_point():
    main()

# e,e
# o,e
# o,o
# o,e遷移は今回は関係なかった

# 負け状態
# 0,0
# 0,1
# 1,1
# まとめると
# X+Y<=1
# abs(X-Y)<=1 <-> >1 と交互

# まとめ方
# 偶奇
# 和と差

__starting_point()

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

if (X == 0 and Y == 0) or (X == 0 and Y == 1) or (
        X == 1 and Y == 0) or (X == 1 and Y == 1):
    print('Brown')
    return

num = abs(X - Y)

if num <= 1:
    print('Brown')
else:
    print('Alice')


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

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


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

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


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

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

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

# 1: starting from there, P1 wins (who starts)
# 0: P0 wins (who doesn't start)
# 
# 0 0 1 1 1 1 1
# 0 0 0 1 1
# 1 0 0 0 
# 1 1 0
# 1 1
# 1
# 1
# |X-Y| <= 1 : 0
# |X-Y| >  1 : 1
## X-Y: must change by 3
X, Y = list(map(int, input().split()))
if abs(X-Y) > 1:
  print('Alice')
else:
  print('Brown')