For this Question: Sara does not like strings which have both the uppercase and the lowercase characters. She thinks only those strings are good which have only lowercase characters(a-z) or only uppercase characters(A-Z).

Given a string s consisting of english alphabets. Find the minimum number of operations required to make it good.

In one operation you can choose any character of the string and change it into uppercase or lowercase.Input contains a single line containing the string s.

Constraint:-
1<=|s|<=100Print the minimum number of operation required to make the string good.Sample Input:
Sara

Sample Output:
1

Explanation:-
'S' should be converted to 's' respectively

Sample Input:
HELLO

Sample Output:-
0

Sample Input:-
pEOpLE

Sample Output:-
2
, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String args[])throws Exception
	{

		BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
		String name=br.readLine();

		int lower=0;
		int uper=0;
		for(int i=0;i<name.length();i++)
		{
			Character ch=name.charAt(i);
			if (ch >= 'a' && ch <= 'z')
			{
			lower++;
			}
			else if(ch>='A' && ch <='Z')
			{
				uper++;
			}
		}
			if(lower<uper)
			{
					System.out.print(lower);
			}
			else
			{
				System.out.print(uper);
			}


	}

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