Score : $600$ points
We have a string $S$ consisting of lowercase English letters.
Bob just thinks about palindromes every day. He decided to choose some of the substrings of $S$ that are palindromes and tell them to Anna.
Anna gets angry if one of the palindromes told by Bob is a substring of another.
How many palindromes can Bob choose while not making Anna angry?
A substring of $S$ is the result of deleting zero or more characters from the beginning and the end of $S$.
For example, ab
is a substring of abc
, while ac
is not a substring of abc
.
Input is given from Standard Input in the following format:
$S$
Print the answer.
ababb
3
Three palindromes aba
, bab
, bb
can be chosen.
xyz
3
Three palindromes x
, y
, z
can be chosen.
xxxxxxxxxx
1