A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when the string is read from left to right as when the string is read from right to left.

Now give you a string S, you should count how many palindromes in any consecutive substring of S.

Input

There are several test cases in the input. Each case contains a non-empty string which has no more than 5000 characters.

Proceed to the end of file.

Output

A single line with the number of palindrome substrings for each case.

Sample Input

aba

aa

Sample Output

4

3

题意：

问有多少个回文的子串。

题解：

从子串的长度考虑，长度为奇数的子串：它的中心只能在[1,len-2]范围内，分别从中心开始向两边扩展，遇到不回文就直接停止拓展。长度为偶数的子串：中心对称的左数范围在[0,len-2]，分别以这中心的两个数向两边扩展。

#include
    
     #include
     
      #include
      
       using namespace std;int main(){    string s;    while(cin>>s)    {        int ans=0;        int len=s.length();        for(int i=1;i
       
        =0&&i+j
        
         =0&&i+j+1