import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //

void solve(){
	long x = read.to!long;
	long y = read.to!long;
	
	string ans;
	if(x == 2 && y == 0) ans = "Brown";
	else if(x == 0 && y == 2) ans = "Brown";
	else if(x == y || x - 1 == y || x + 1 == y) ans = "Brown";
	else ans = "Alice";
	
	ans.writeln;
}

void experiment(long x, long y){
	
	long[2][][long[2]] qs;
	foreach(s; 0 .. x + y + 1) foreach(t; -s .. s + 1){
		if((s + t) % 2 != 0) continue;
		long a = (s + t) / 2, b = (s - t) / 2;
		qs[[a, b]] = [];
		for(long i = 1; i * 2 < a; i ++) qs[[a, b]] ~= [a - 2 * i, b + i];
		for(long i = 1; i * 2 < b; i ++) qs[[a, b]] ~= [a + i, b - 2 * i];
	}
	
	long[long[2]] gr;
	foreach(s; 0 .. x + y + 1) foreach(t; -s .. s + 1){
		if((s + t) % 2 != 0) continue;
		long a = (s + t) / 2, b = (s - t) / 2;
		long [] gs = qs[[a, b]].map!(k => gr[k]).array;
		gs.sort();
		foreach(g; 0 .. x + y){
			if(! gs.canFind(g)){
				gr[[a, b]] = g;
				break;
			}
		}
	}
	
	foreach(a; 0 .. x + 1){
		foreach(b; 0 .. y + 1){
			gr[[a, b]].write;
			" ".write;
		}
		"".writeln;
	}
}

/*
x + y =: s, x - y =: t.

(s, t) -> (s - i, t - 3i)

ただし s + t >= 4i
このとき可能

つまり、s + t だけ考えればよく
(s + t) / 4 まで引くことができる

Grundy数


*/
