output_description: Print the winner: either `Alice` or `Brown`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      X Y
attempt: #!/usr/bin/env python
  # -*- coding: utf-8 -*-
  
  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
  
  # }}}
  
  # pre-defined{{{
  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)
  ]  # can also use string module
  
  
  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()
  # vim: set foldmethod=marker:}}}
  
problem_description: 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.
samples: [{"input": "2 1", "output": "Brown\n    \n\nAlice can do nothing but taking two stones from the pile containing two\nstones. As a result, the piles consist of zero and two stones, respectively.\nThen, Brown will take the two stones, and the piles will consist of one and\nzero stones, respectively. Alice will be unable to perform the operation\nanymore, which means Brown's victory.\n\n* * *"}, {"input": "5 0", "output": "Alice\n    \n\n* * *"}, {"input": "0 0", "output": "Brown\n    \n\n* * *"}, {"input": "4 8", "output": "Alice"}]