시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 (추가 시간 없음) 64 MB444100.000%

문제

A pair of strings form an anagram if the first of them can be transformed into the second by a permutation of letters. For example, "listen" and "silent" form an anagram, but "master" and "nearest" do not.

A subsequence of string $s = s_1 s_2 \dots s_n$ is a string $s_{a_1} s_{a_2} \dots s_{a_k}$, where $1 \le a_1 < a_2 < \dots < a_k \le n$.

Given string $s$, determine the maximal number of its subsequences which can be written down such that no pair of strings in the resulting list does form an anagram.

입력

A single line containing string $s$ of at most $60$ small latin letters.

출력

Print one number --- the answer.

예제 입력 1

jojo

예제 출력 1

8

예제 입력 2

uralchampionship

예제 출력 2

20735

노트

In the first sample the resulting list of strings may be: "j", "o", "jj", "jo", "oo", "jjo", "joo", "jojo".