For this Question: You are given a string s consisting of n lowercase Latin letters.

You have to remove at most one (i. e. zero or one) character of this string in such a way that the string you obtain will be lexicographically smallest among all strings that can be obtained using this operation.

For example, "aaa" is smaller than "aaaa", "abb" is smaller than "abc", "pqr" is smaller than "z".The first line contains one integer n — the length of s.
The second line contains string s.

Constraints:
1<=|s|<=200000Print one string — the smallest possible lexicographically string that can be obtained by removing at most one character from the string s.Sample Input 1:
5
abcda

Sample Output 1:
abca

Explanations:
In given example "abca" < "abcd" < "abcda" < "abda" < "acda" < "bcda"., I have written this Solution Code: import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner cs = new Scanner(System.in);
        int n = cs.nextInt();
        String a = cs.next();
        boolean A = false;
        for(int i = 0; i < n - 1; ++i){
            if(A) {
                System.out.print(a.charAt(i));
                continue;
            }
            if((a.charAt(i) - '0') > (a.charAt(i + 1) - '0')){
                A = true;
            }
            else System.out.print(a.charAt(i));
        }
        if(A) System.out.print(a.charAt(n-1));
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?