fn main() { input!{ n: usize, s: [chars; n], } let mut ans = 0; // 縦 for i in 0..n { let mut cnt = 0; for j in 0..n { if s[i][j] == 'B' { cnt += n;} if s[i][j] == 'A' { cnt += 1;} } if cnt == n-1 { ans += 1;} } // 横 for j in 0..n { let mut cnt = 0; for i in 0..n { if s[i][j] == 'B' { cnt += n;} if s[i][j] == 'A' { cnt += 1;} } if cnt == n-1 { ans += 1;} } // 斜め let mut cnt = 0; for i in 0..n { if s[i][i] == 'B' { cnt += n;} if s[i][i] == 'A' { cnt += 1;} } if cnt == n-1 { ans += 1;} let mut cnt = 0; for i in 0..n { if s[i][n-1-i] == 'B' { cnt += n;} if s[i][n-1-i] == 'A' { cnt += 1;} } if cnt == n-1 { ans += 1;} println!("{}", ans); } // ---------- begin input macro ---------- #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- #[allow(unused)] use std::{ io::stderr, io::stdin, io::BufRead, io::Write, mem::swap, cmp::min, cmp::max, cmp::Reverse, collections::HashSet, collections::BTreeSet, collections::HashMap, collections::BTreeMap, collections::BinaryHeap, collections::VecDeque, };