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:
st = list(raw_input())
cnt = 0
flg = 0
sr = []
for i in range(len(st)):
	for j in range(i,len(st)):
		sr = st[i:j+1]
		flg=0
		if len(sr) == 1:
			cnt +=1
			continue
		for k in range(len(sr)/2):
			if sr[k] != sr[len(sr)-k-1]:
				flg = 1
				break
		if flg == 0:
			cnt+=1
			#print sr
print cnt