#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <cstring>
#include <queue>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <numeric>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

//Alice win true, lose false
int memo[100][100][2];//Alice win 1, lose -1
bool go(ll x, ll y, bool Bob){
  if (x < 2 && y < 2) {
    return Bob;
  }
  if (memo[x][y][Bob] != 0) {
    return memo[x][y][Bob] == 1; 
  }
  if (!Bob) {//Alice
    for (ll i = 1, n = x / 2; i <= n; i++) {
      if (go(x-2*i, y+i, !Bob)) {
        memo[x][y][Bob] = 1;
        return true;
      }
    }
    for (ll i = 1, n = y / 2; i <= n; i++) {
      if (go(x+i, y-2*i, !Bob)) {
        memo[x][y][Bob] = 1;
        return true;
      }
    }
    memo[x][y][Bob] = -1;
    return false;
  } else {
    for (ll i = 1, n = x / 2; i <= n; i++) {
      if (!go(x-2*i, y+i, !Bob)) {
        memo[x][y][Bob] = -1;
        return false;
      }
    }
    for (ll i = 1, n = y / 2; i <= n; i++) {
      if (!go(x+i, y-2*i, !Bob)) {
        memo[x][y][Bob] = -1;
        return false;
      }
    }
    memo[x][y][Bob] = 1;
    return true;
  }
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  ll x, y;
  cin >> x >> y;
  if (abs(x-y) <= 1) {
    cout << "Brown" << endl;
  } else {
    cout << "Alice" << endl;
  }
  
  /*
  for (ll i = 0; i <= 90; i++) {
    for (ll j = 0; j <= 90; j++) {
      if (go(i,j,false)) {
        cout << i << ' ' << j << ' ' << "Alice win!" << endl;
      } else {
        cout << i << ' ' << j << ' ' << "Bob win!" << endl;
      }
    }
  }
  */
  return 0;
}



Measured memory_bytes: 256