For this Question: Your school has N students, and each student has a strength denoted by an integer. You have to make a team by picking some students such that gcd of strengths of those students is not 1, otherwise they tend to fight all the time, and there wil be no team spirit .
What is the maximum number of students you can pick ?The input consists of two lines.
The first line contains an integer n, the number of Students in the school
The next line contains n space separated integers, where the i-th of them denotes s[i], the strength of the i-th Student.

Constraints:-
1<=n<=10^5
1<=s<=10^5Print single integer — the maximum number of Students you can take.Input:
5
2 3 4 6 7

Output:
3

Input:
8
45 23 12 3 4 62 2 4

Output:
5, 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));
					  int n = Integer.parseInt(br.readLine());
					  String ar[] = br.readLine().split(" ");
					  int a[] = new int[n];
					  int max = Integer.MIN_VALUE;
					  for(int i=0;i<n;i++){
					  a[i] = Integer.parseInt(ar[i]);
					  max = Math.max(max,a[i]);
					  }
					  int ans = 1;
					 for(int i=2;i<=Math.sqrt(max);i++)
					 {   int count=0,k=0;
						 for(int j=0;j<n;j++)
						 {
                           if(a[j]%i ==0)
						   count++;
						   if(i>a[j])
						   k++;
						 }
						 ans = Math.max(ans,count);
						 if(count>=n-k)
						 break;
					 }
					 System.out.println(ans);

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