For this Question: You are given a string <i>s</i> consisting of lowercase English letters. Find the number of different palindromes you can make by changing <b>exactly</b> one charecter from the string to some other lowercase English letter.The first and single line contains string <i>s</i> (1 &le; |<i>s</i>| &le; 10).Print the number of different palindromes you can make by changing <b>exactly</b> one charecter from the string to some other lowercase English letter. Sample Input 1
abbb

Sample Output 1
2

Explanation:
The possible palindromes are:
    1. abba
    2. bbbb

========================================================================

Sample Input 2
abba

Sample Output 2
0

, I have written this Solution Code: n=input()
n=list(n)
ln=len(n)
cnt=0
for i in range(ln//2):
    if not(n[i]==n[ln-i-1]):
        cnt+=1
if(cnt==1):
    print(2)

elif(cnt==0 and ln%2==1):
    print(25)
else:
    print(0), In this Programming Language: Python, Now tell me if this Code is compilable or not?