For this Question: Tom loves palindromes. He has the power to convert any ordinary string to a palindrome.
In one move tom can choose a character of a string and change it to any other character.
Given a string, find the minimum number of moves in which tom can change it to a palindrome.Input consists of a string.
Every character of a string contains lowercase alphabets 'a' to 'z' inclusive.

Constraints
1 <= |s| <= 1000The minimum number of moves to convert the given string to a palindrome.Sample input 1
naman              

Sample output 1
0

Sample input 2 
reorder

Sample output 2
1, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;

#define pu push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
#define pii pair<int,int>
#define mm (s+e)/2
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define sz 200000
signed main()
{
	
		string s;
		cin>>s;
		int n=s.size();
		int cnt=0;
		for(int i=0;i<n/2;i++)
		{
           if(s[i]!=s[n-1-i]) cnt++;
		}
		cout<<cnt<<endl;
	
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?