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: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException
	{
    	BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String line=br.readLine();


		int count=0;
		int i=0,j=line.length()-1;
		while(i<line.length() && j>=0)
			{
				if(line.charAt(i)!=line.charAt(j))
					count++;

				i++; j--;
			}
		System.out.print(count/2);

	}




















}, In this Programming Language: Java, Now tell me if this Code is compilable or not?