#[allow(unused_imports)] use std::cmp::{max, min, Ordering}; #[allow(unused_imports)] use std::collections::{HashMap, HashSet, BinaryHeap, VecDeque}; #[allow(unused_imports)] use std::iter::FromIterator; mod util { use std::io::stdin; use std::str::FromStr; use std::fmt::Debug; #[allow(dead_code)] pub fn line() -> String { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().to_string() } #[allow(dead_code)] pub fn get() -> T where ::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().parse().unwrap() } #[allow(dead_code)] pub fn gets() -> Vec where ::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.split_whitespace() .map(|t| t.parse().unwrap()) .collect() } #[allow(dead_code)] pub fn get2() -> (T, U) where ::Err: Debug, ::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); let mut iter = line.split_whitespace(); ( iter.next().unwrap().parse().unwrap(), iter.next().unwrap().parse().unwrap(), ) } #[allow(dead_code)] pub fn get3() -> (S, T, U) where ::Err: Debug, ::Err: Debug, ::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); let mut iter = line.split_whitespace(); ( iter.next().unwrap().parse().unwrap(), iter.next().unwrap().parse().unwrap(), iter.next().unwrap().parse().unwrap(), ) } } #[allow(unused_macros)] macro_rules! debug { ($x: expr) => { println!("{}: {:?}", stringify!($x), $x) } } fn main() { let s: Vec = util::line().chars().collect(); let mut front = Vec::new(); let mut back = Vec::new(); { let mut a = VecDeque::new(); let mut b = VecDeque::new(); for (i, &c) in s.iter().enumerate() { a.push_front(c); b.push_back(c); if a == b { front.push(i); } } } { let mut a = VecDeque::new(); let mut b = VecDeque::new(); for (i, &c) in s.iter().enumerate().rev() { a.push_front(c); b.push_back(c); if a == b { back.push(i); } } } let mut ans = 0; back.sort(); for &p in &front { let mut a = VecDeque::new(); let mut b = VecDeque::new(); for (&c, i) in s[p + 1..].iter().zip(1..) { a.push_front(c); b.push_back(c); if a == b { ans += back.len() as u64 - match back.binary_search(&(p + i + 2)) { Ok(x) => x as u64, Err(x) => x as u64, }; } } } println!("{}", ans); }