pub mod io {
    use std::io::{BufRead, ErrorKind};

    pub fn scan<R: BufRead>(r: &mut R) -> Vec<u8> {
        let mut res = Vec::new();
        loop {
            let buf = match r.fill_buf() {
                Ok(buf) => buf,
                Err(e) if e.kind() == ErrorKind::Interrupted => continue,
                Err(e) => panic!("{}", e), 
            };
            let (done, used, buf) = {
                match buf.iter().position(u8::is_ascii_whitespace) {
                    Some(i) => (i > 0 || res.len() > 0, i + 1, &buf[..i]),
                    None => (buf.is_empty(), buf.len(), buf),
                }
            };
            res.extend_from_slice(buf);
            r.consume(used);
            if done { return res; }
        }
    }

    #[macro_export]
    macro_rules! scan {
        ($r:expr, [$t:tt; $n:expr]) => {
            (0..$n).map(|_| scan!($r, $t)).collect::<Vec<_>>()
        };
        ($r:expr, [$t:tt]) => {
            scan!($r, [$t; scan!($r, usize)])
        };
        ($r:expr, ($($t:tt),*)) => {
            ($(scan!($r, $t)),*)
        };
        ($r:expr, Usize1) => {
            scan!($r, usize) - 1
        };
        ($r:expr, Bytes) => {
            io::scan($r)
        };
        ($r:expr, String) => {
            String::from_utf8(scan!($r, Bytes)).unwrap()
        };
        ($r:expr, $t:ty) => {
            scan!($r, String).parse::<$t>().unwrap()
        };
    }

    #[macro_export]
    macro_rules! input {
        ($r:expr, $($($v:ident)* : $t:tt),* $(,)?) => {
            $(let $($v)* = scan!($r, $t);)*
        };
    }
}

pub mod prime_factorize {
    pub struct PrimeFactorize {
        mpf: Vec<usize>,
    }
    
    impl PrimeFactorize {
        pub fn new(n: usize) -> Self {
            let mut mpf = (0..=n).collect::<Vec<_>>();
            for i in 2.. {
                if i * i > n {
                    break;
                }
                if mpf[i] < i {
                    continue;
                }
                for j in (i * i..=n).step_by(i) {
                    if mpf[j] == j {
                        mpf[j] = i;
                    }
                }
            }
            Self {
                mpf,
            }
        }
    
        pub fn prime_factorize(&self, mut n: usize) -> Vec<usize> {
            let mut res = Vec::new();
            while n > 1 {
                res.push(self.mpf[n]);
                n /= self.mpf[n];
            }
            res
        }
    
        pub fn count_prime_factors(&self, mut n: usize) -> usize {
            let mut res = 0;
            while n > 1 {
                res += 1;
                n /= self.mpf[n];
            }
            res
        }
    }    
}

use prime_factorize::PrimeFactorize;

const MAX: usize = 1_000_000;

fn run<R: std::io::BufRead, W: std::io::Write>(reader: &mut R, writer: &mut W) {
    input! {
        reader,
        n: usize,
        a: [usize; n],
    }

    let pf = PrimeFactorize::new(MAX);

    let mut xor = 0;
    for a in a {
        xor ^= pf.count_prime_factors(a);
    }

    writeln!(writer, "{}", if xor > 0 { "white" } else { "black" }).ok();
}

fn main() {
    let (stdin, stdout) = (std::io::stdin(), std::io::stdout());
    let ref mut reader = std::io::BufReader::new(stdin.lock());
    let ref mut writer = std::io::BufWriter::new(stdout.lock());
    run(reader, writer);
}