For this Question: Given a positive integer N, construct a string of length N such that no two adjacent characters are the same. Among all possible strings, find the lexicographically minimum string.
Note: You can use only lowercase characters from 'a' to 'z'.The first and only line of input contains an integer N.

<b>Constraints:</b>
1 <= N <= 10<sup>5</sup>Print the required string.Sample Input 1:
1

Sample Output 1:
a

Sample Input 2:
2

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



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

        InputStreamReader isr = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader(isr);
        int len = Integer.parseInt(br.readLine());
        char[] str = new char[len];
        for(int i = 0; i < len; i++){
            if(i%2 == 0){
                str[i] = 'a';
            } else{
                str[i] = 'b';
            }
        }
        System.out.println(str);

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