For this Question: We define a number <b>A</b> as a good integer if:
the number of divisors (excluding 1 and the number itself) of A is greater than 0 and the divisors would be in consecutive sequence when arranged in sorted order
Given a number N, calculate the number of <b>good integers</b> less than or equal to N.The input contains a single integer N.

<b>Constraints:</b>
1 <= N <= 10<sup>9</sup>Print the number of good integers less than or equal to N.Sample Input:-
4

Sample Output:-
1

Sample Input:-
9

Sample Output:-
3

Explanation:- 4 6 9 are the only good integers, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	static int a[]=new int[100001];
	static void seive(int a[])
	{
		a[0]=1;a[1]=1;
		for(int i=2;i*i<=100001;i++)
		{
			if(a[i]==0)
			{
				for(int j=i*i;j<100001;j+=i)
				{
					a[j]=1;
				}
			}
		}
	}
	public static void main (String[] args) throws IOException{
		BufferedReader scan=new BufferedReader(new InputStreamReader(System.in));
		int n=Integer.parseInt(scan.readLine());
		seive(a);
		if(n<4)
		{
			System.out.println(0);
		}
		else if(n<6)
		{
			System.out.println(1);
		}
		else if(n<9)
		{
			System.out.println(2);
		}
		else
		{
			int ans=2;
			for(int i=3;i*i<=n;i+=2)
			{
				if(a[i]==0)
				{
					ans++;
				}
			}
			System.out.println(ans);
		}

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