#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::collections::HashMap;

#[allow(unused_macros)]
macro_rules! read {
    ([$t:ty] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ($($t:ty),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ([$t:ty]) =>
        (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::<Vec<$t>>());
    ($t:ty) =>
        (rl().parse::<$t>().unwrap());
    ($($t:ty),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(w.next().unwrap().parse::<$t>().unwrap()),*)
    }};
}

#[allow(dead_code)]
fn rl() -> String {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).unwrap();
    buf.trim_end().to_owned()
}

trait IteratorExt: Iterator + Sized {
    fn vec(self) -> Vec<Self::Item> {
        self.collect()
    }
}
impl<T: Iterator> IteratorExt for T {}

fn main() {
    let s = read!(String);
    let mut table = vec![0; 26];

    for c in s.chars() {
        table[c as usize - 'A' as usize] += 1;
    }

    let mut ans = fact(s.len());
    for e in table {
        if e != 0 {
            ans /= fact(e);
        }
    }

    println!("{}", ans - 1);
}

fn fact(n: usize) -> usize {
    let mut tmp = 1;
    for i in 2..=n {
        tmp *= i;
    }
    tmp
}