#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause") //comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
const ld pi = acos(-1);
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }return 0; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; }return 0; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

vector<vector<VI>> memo;
int solve(int x, int y, int turn) {
    if (memo[x][y][turn] != -1)return memo[x][y][turn];

    if (turn == 0) {
        for (int i = 2; i <= x; i += 2)if (solve(x - i, y + i / 2, turn ^ 1) == 1) {
            return memo[x][y][turn] = 1;
        }
        for (int i = 2; i <= y; i += 2)if (solve(x + i / 2, y - i, turn ^ 1) == 1) {
            return memo[x][y][turn] = 1;
        }
        return memo[x][y][turn] = 0;
    }
    else {
        for (int i = 2; i <= x; i += 2)if (solve(x - i, y + i / 2, turn ^ 1) == 0) {
            return memo[x][y][turn] = 0;
        }
        for (int i = 2; i <= y; i += 2)if (solve(x + i / 2, y - i, turn ^ 1) == 0) {
            return memo[x][y][turn] = 0;
        }
        return memo[x][y][turn] = 1;
    }
}

void test() {
    int n; cin >> n;
    memo = defvec<int>(-1, 2 * n + 1, 2 * n + 1, 2);
    eFOR(i, 0, n) {
        if (i < 10)cout << " ";
        cout << i;
        eFOR(j, 0, n) {
            cout << (solve(i, j, 0) == 1 ? 'o' : 'x');
        }
        cout << "\n";
    }
}

void answer() {
    ll x, y; cin >> x >> y;
    cout << (abs(x - y) <= 1 ? "Brown\n" : "Alice\n");
}

int main() {
    init();

    //test();
    answer();
}


Measured memory_bytes: 256