Given a string, output the number of nice pairs of special substrings. A special substring is a string that reads the same forwards and backwards. A nice pair of substrings is a pair of substrings that has the following property: after you remove the first substring from the string, you can still remove the second substring from the string (note that neither substring should be contained in the other to be nice).
The first and only line of input will contain a string consisting of lowercase letters. The length of the string will be at least ~1~ and at most ~10^5~ characters long.
Output the number of nice pairs of special substrings.
Sample Input 1
Sample Output 1
Sample Input 2
Sample Output 2