For this Question: Newton got a string as a gift on Christmas. Newton likes palindromes so he decides to make this string into a palindrome. He can kick the string and after every kick, he can change any one of its characters to any other character of his choice.
Find the minimum number of times that Newton has to kick the string.The first and the only line of the input contains a single string S

<b>Constraints:</b>
<ul>
<li>1 &le; |S| &le; 1000</li>
<li>All characters in S are in lowercase and are English letters</li>
</ul>Output the answer<b>Sample Input 1:</b>
newton

<b>Sample Output 1:</b>
2


<b>Sample Input 2:</b>
abbcbba

<b>Sample Output 2:</b>
0

<b>Sample Explanation 1:</b>
In the first kick, Newton changes the 2nd character to 'o'
In the second kick, Newton changes the 4th character to 'w'.
Thus, the final word is "nowwon" which is a palindrome., I have written this Solution Code: #include<iostream>
#include<string>
using namespace std;
int main(){
    string S;
    cin >> S;
    int ans = 0;
    for(int i = 0;i<S.size()/2;++i){
        if(S[i]!=S[S.size()-1-i])
        {
            ++ans;
        }
    }
    cout << ans << endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?