#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BinaryHeap, HashMap};

#[allow(dead_code)]
type Graph = Vec<Vec<usize>>;

fn game(x: usize, y: usize, turn: usize, cache: &mut Vec<Vec<Vec<usize>>>) -> usize {
    if cache[turn][x][y] != 0 {
        return cache[turn][x][y];
    }

    for i in 1..x {
        if i * 2 > x {
            break;
        }
        let r = game(x - i * 2, y + i, 3 - turn, cache);
        if r == turn {
            cache[turn][x][y] = turn;
            return turn;
        }
    }

    for i in 1..y {
        if i * 2 > y {
            break;
        }
        let r = game(x + i, y - i * 2, 3 - turn, cache);
        if r == turn {
            cache[turn][x][y] = turn;
            return turn;
        }
    }


    cache[turn][x][y] = 3 - turn;
    3 - turn
}

fn main() {
    input! {
        x: i64,
        y: i64,
    }

    // let mut cache = vec![vec![vec![0; 100]; 100]; 3];
    // cache[1][0][0] = 2;
    // cache[1][1][1] = 2;
    // cache[1][1][0] = 2;
    // cache[1][0][1] = 2;
    // cache[2][0][0] = 2;
    // cache[2][1][1] = 1;
    // cache[2][1][0] = 1;
    // cache[2][0][1] = 1;

    // for i in 0..50 {
    //     for j in 0..50 {
    //         if game(i, j, 1, &mut cache) != 1 {
    //             println!("{} {}", i, j);
    //         }
    //     }
    // }

    if (x - y).abs() <= 1 {
        println!("Brown");
    } else {
        println!("Alice");
    }

    // println!("{}", ans);
}


Measured memory_bytes: 4352