Problem: Given a string S, count the number of non empty sub strings that are palindromes.
A sub string is any continuous sequence of characters in the string.
A string is said to be palindrome, if the reverse of the string is same as itself.
Two sub strings are different if they occur at different positions in S

Input
Input contains only a single line that contains string S.   

Output
Print a single number, the number of sub strings that are palindromes.

Constraints
1 ≤ |S| ≤ 50
S contains only lower case latin letters, that is characters a to z.

SAMPLE INPUT
dskjkd

SAMPLE OUTPUT
7

Explanation

The 7 sub strings are d, s, k, j, k, d, kjk.

Solution (in PYTHON):

Solution:
def reverse(s,i,f):
    a=""
    b=""
    for j in range(i,f):
        b+=s[j]
    for j in range(f-1,i-1,-1):
        a+=s[j]
    if(a==b and i!=f):
        return 1
    return 0
def count(s):
    i=-1
    total=0
    while(i<len(s)):
        i+=1
        f=len(s)
        while(i<=f):
            if(reverse(s,i,f)):
                    total+=1     
            f-=1
    return total
string=raw_input()
print count(string)