#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn dfs(x: usize, y: usize, grundy: &mut BTreeMap<(usize,usize), usize>) -> usize {
    let (x,y) = if x>y {
        (y,x)
    } else {
        (x,y)
    };
    if let Some(&num) = grundy.get(&(x,y)) {
        return num;
    }
    if x/2 == 0 && y/2 == 0 {
        grundy.insert((x,y), 0);
        return 0;
    }
    let mut set = HashSet::new();
    for i in 0..x/2 {
        let res = dfs(x-(i+1)*2, y+i+1, grundy);
        set.insert(res);
    }
    for i in 0..y/2 {
        let res = dfs(x+i+1, y-(i+1)*2, grundy);
        set.insert(res);
    }
    for i in 0.. {
        if !set.contains(&i) {
            grundy.insert((x,y), i);
            return i;
        }
    }
    0
}

fn solve() {
    let (x,y) = get!(usize, usize);

    // let mut map = BTreeMap::new();
    // dfs(x,y,&mut map);
    // for (k,v) in map {
    //     if v == 0 {
    //         debug!(k);
    //     }
    // }
    if x/2 == 0 && y/2 == 0 {
        println!("Brown");
        return;
    }

    if x==y {
        println!("Brown");
        return;
    }
    let (x,y) = if x>y {
        (y,x)
    } else {
        (x,y)
    };

    if x+1 == y {
        println!("Brown");
    } else {
        println!("Alice");
    }
}


Measured memory_bytes: 8572