pub mod io { pub fn scan(r: &mut R) -> Vec { let mut res = Vec::new(); loop { let buf = match r.fill_buf() { Ok(buf) => buf, Err(e) if e.kind() == std::io::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::>()); ($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, String) => (String::from_utf8(scan!($r, Bytes)).unwrap()); ($r:expr, Bytes) => (io::scan($r)); ($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);)* }; } } fn get_primes(n: usize) -> Vec { let mut primes = Vec::new(); let mut is_prime = vec![true; n + 1]; for p in 2..=n { if !is_prime[p] { continue; } primes.push(p); let mut q = 2 * p; while q <= n { is_prime[q] = false; q += p; } } primes } fn run(reader: &mut R, writer: &mut W) { input! { reader, s: Bytes, } let primes = get_primes(100_000); let s = s.iter().map(|b| (b - b'0') as u64).collect::>(); let mut ans = 0; for bit in 0..(1 << (s.len() - 1)) { let mut sum = 0; let mut x = s[0]; for (i, s) in s[1..].iter().enumerate() { if bit >> i & 1 == 0 { x = x * 10 + s; } else { sum += x; x = *s; } } sum += x; if sum == 1 { continue; } if primes.binary_search(&(sum as usize)).is_ok() { ans += 1; } else if primes.iter().all(|p| sum % *p as u64 > 0) { ans += 1; } } writeln!(writer, "{}", ans).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); }