//! ----------------------------------------------
//! Framework <https://github.com/vain0x/procon>
//!
//! See the bottom of file for solution.
//! ----------------------------------------------

#![allow(unused_imports)]
#![allow(non_snake_case)]

use std::cell::RefCell;
use std::cmp::{max, min, Ordering};
use std::collections::*;
use std::fmt::{Debug, Display, Formatter, Write as FmtWrite};
use std::io::{stderr, stdin, BufRead, Write};
use std::mem::{replace, swap};
use std::ops::*;
use std::rc::Rc;

/// Print values to standard error if debug mode.
#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), stderr());
            writeln!(err, "\x1B[33m{}\x1B[0m = {:?}", e, $e).unwrap()
        })*
    };
}

/// Read from standard input and parse each word.
/// - `read!(T, U, ..)` parses a line as a tuple of words.
/// - `read![[T]]` parses a line as an array of words.
/// - `read![..; N]` parses `N` lines, using `read!(..)` repeatedly.
#[allow(unused_macros)]
macro_rules! read {
    ([$t:ty] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ($($t:ty),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ([$t:ty]) =>
        (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::<Vec<$t>>());
    ($($t:ty),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(w.next().unwrap().parse::<$t>().unwrap()),*)
    }};
}

/// Read a line from standard input.
#[allow(dead_code)]
fn rl() -> String {
    let mut buf = String::new();
    stdin().read_line(&mut buf).unwrap();

    #[allow(deprecated)]
    buf.trim_right().to_owned()
}

// -----------------------------------------------
// Solution
// -----------------------------------------------

// const WIN: bool = true;
// const LOSE: bool = false;

// struct Solve {
//     dp: HashMap<(u32, u32), bool>,
// }

// impl Solve {
//     fn dfs(&mut self, x: u32, y: u32) -> bool {
//         if x <= 1 && y <= 1 {
//             return LOSE;
//         }

//         let (x, y) = if x <= y { (x, y) } else { (y, x) };

//         if let Some(&win) = self.dp.get(&(x, y)) {
//             return win;
//         }

//         let memo = |this: &mut Solve, result| {
//             this.dp.insert((x, y), result);
//             result
//         };

//         for i in 1..x / 2 + 1 {
//             if self.dfs(x - 2 * i, y + i) == LOSE {
//                 return memo(self, WIN);
//             }
//         }

//         for i in 1..y / 2 + 1 {
//             if self.dfs(x + i, y - 2 * i) == LOSE {
//                 return memo(self, WIN);
//             }
//         }

//         memo(self, LOSE)
//     }
// }

// fn show(n: u32) {
//     let mut solve = Solve { dp: HashMap::new() };

//     for x in 0..n {
//         for y in x..n {
//             let win = solve.dfs(x, y);
//             println!("({}, {}) {}", x, y, if win { "Win" } else { "Lose" });
//         }
//     }
// }

fn main() {
    // show(100);

    let (X, Y) = read!(i64, i64);
    let win = (X - Y).abs() >= 2;
    println!("{}", if win { "Alice" } else { "Brown" });
}


Measured memory_bytes: 4352