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: 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 str = br.readLine();
					  int i=0,ans=0;
					  int j=str.length()-1;
					  while(i<=j){
						  if(str.charAt(i)!=str.charAt(j)){
							  ans++;
						  }
						  i++;
						  j--;
					  }
					  System.out.println(ans);

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