#![allow(unused_imports, unused_macros, dead_code)] use std::{cmp::*, collections::*}; fn main() { let mut sc = Scanner::new(); let s: Vec> = (0..3).map(|_| sc.chars()).collect(); let neigh = neighbor::Grid4(3, 3); let mut ans = "Yes"; for i in 0..3 { for j in 0..3 { for (u, v) in neigh.iter(i, j) { if s[i][j] == s[u][v] { ans = "No"; } } } } put!(ans); } // @misc/neighbor /// Misc - Neighbor pub mod neighbor { pub struct Grid4(pub usize, pub usize); impl Grid4 { pub fn iter(&self, i: usize, j: usize) -> VecIter<(usize, usize)> { let mut v = vec![]; for s in 0..3 { for t in 0..3 { if (s + t) % 2 == 1 && (1..self.0 + 1).contains(&(i + s)) && (1..self.1 + 1).contains(&(j + t)) { v.push((i + s - 1, j + t - 1)); } } } VecIter(v) } } pub struct Grid8(pub usize, pub usize); impl Grid8 { pub fn iter<'a>(&'a self, i: usize, j: usize) -> VecIter<(usize, usize)> { let mut v = vec![]; for s in 0..3 { for t in 0..3 { if (s * t) != 1 && (1..self.0 + 1).contains(&(i + s)) && (1..self.1 + 1).contains(&(j + t)) { v.push((i + s - 1, j + t - 1)); } } } VecIter(v) } } pub struct VecIter(Vec); impl Iterator for VecIter { type Item = T; fn next(&mut self) -> Option { self.0.pop() } } } // {{{ use std::io::{self, Write}; use std::str::FromStr; pub struct Scanner { stdin: io::Stdin, buffer: VecDeque, } impl Scanner { pub fn new() -> Self { Self { stdin: io::stdin(), buffer: VecDeque::new(), } } pub fn cin(&mut self) -> T { while self.buffer.is_empty() { let mut line = String::new(); let _ = self.stdin.read_line(&mut line); for w in line.split_whitespace() { self.buffer.push_back(String::from(w)); } } self.buffer.pop_front().unwrap().parse::().ok().unwrap() } pub fn usize1(&mut self) -> usize { self.cin::() - 1 } pub fn chars(&mut self) -> Vec { self.cin::().chars().collect() } pub fn vec(&mut self, n: usize) -> Vec { (0..n).map(|_| self.cin()).collect() } } fn flush() { std::io::stdout().flush().unwrap(); } #[macro_export] macro_rules! min { (.. $x:expr) => {{ let mut it = $x.iter(); it.next().map(|z| it.fold(z, |x, y| min!(x, y))) }}; ($x:expr) => ($x); ($x:expr, $($ys:expr),*) => {{ let t = min!($($ys),*); if $x < t { $x } else { t } }} } #[macro_export] macro_rules! max { (.. $x:expr) => {{ let mut it = $x.iter(); it.next().map(|z| it.fold(z, |x, y| max!(x, y))) }}; ($x:expr) => ($x); ($x:expr, $($ys:expr),*) => {{ let t = max!($($ys),*); if $x > t { $x } else { t } }} } #[macro_export] macro_rules! trace { ($x:expr) => { #[cfg(debug_assertions)] eprintln!(">>> {} = {:?}", stringify!($x), $x) }; ($($xs:expr),*) => { trace!(($($xs),*)) } } #[macro_export] macro_rules! put { (.. $x:expr) => {{ let mut it = $x.iter(); if let Some(x) = it.next() { print!("{}", x); } for x in it { print!(" {}", x); } println!(""); }}; ($x:expr) => { println!("{}", $x) }; ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) } } #[macro_export] macro_rules! ndarray { ($x:expr;) => { $x }; ($x:expr; $size:expr $( , $rest:expr )*) => { vec![ndarray!($x; $($rest),*); $size] }; } // }}}