For this Question: Given a string S find minimum number of changes required to make the string palindrome. In a change you can change any index of the string to any character.
A palindrome is a string that remains the same if reversed.First and only line of input contains a string S.

Constraints
1 <= |S| <=  100000
S contains only lowercase lettersOutput a single integer which is the minimum number  of changes required to make string palindrome.sample input 1
abc

sample output 1
1

sample input 2
abcdef

sample output 2
3
, I have written this Solution Code: n = input()
count = 0
i = 0
j = len(n)-1
while i <= j:
	if n[i] != n[j]:
		count += 1
	i += 1
	j -= 1
print(count), In this Programming Language: Python, Now tell me if this Code is compilable or not?