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:
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
# print 'Hello World!'

str1 = raw_input()
combinat = []

def combinations(str1, i, l):
	ret = []
	exit = 0
	for k in range(0, l, 1):
		im = []
		for j in range(k, k+i-1):
			if j < l:
				im.append(str1[j])
			else:
				exit = 1
				break
		if exit != 1 and im != []:
			ret.append(im)
	return ret

l = len(str1)
for i in range(1, l + 1):
	els = combinations(str1, i, l)
	combinat.extend(els)

count = 0

for i in range(len(combinat)):
	c1 = combinat[i][-1::-1]
	if c1 == combinat[i]:
		count += 1
print count