For this Question: Currently, Adk is researching a virus that has conquered the planet. For killing the virus, three chemicals (A, B, and C) are required in a particular proportion. Let the quantities of chemicals be a, b, and c respectively.
The virus will be killed if a<sup>2</sup>+b<sup>2</sup>+c<sup>2</sup>=n.
You need to find the number of triplets satisfying the condition for all the values of n ranging from 1 to N.
<b>Note:</b> a, b and c must be integers.
<b>Note:</b> Obviously, the amount of chemical cannot be negative.The first and only line of input contains an integer N.

<b>Constraints:</b>
1 <= N <= 10000Output N integers, the number of triplets satisfying the condition for n = 1, 2, 3, ..., N on a new line.Sample Input:
10

Sample Output:
3
3
1
3
6
3
0
3
6
6

<b>Explanation:</b>
For n=1, triplets are (0, 0, 1), (1, 0, 0), (0, 1, 0)
For n=7, there are no triplets satisfying the condition.
For n=10, triplets are (0, 1, 3), (0, 3, 1), (1, 0, 3), (1, 3, 0), (3, 0, 1), (3, 1, 0)., I have written this Solution Code: import java.util.*;
import java.io.*;
public class Main{
    public static void main(String[] args)throws IOException{
       BufferedReader sc=new BufferedReader(new InputStreamReader(System.in));
       String s=sc.readLine();
        int n=Integer.parseInt(s);
        int temp=1;
        StringBuilder br=new StringBuilder();
        int j=0,k=1;
        while(temp<=n){
            if(7*k+j==temp) { br.append(0+"\n");k++;j++;}
            else
               br.append(count(temp)+"\n");
           temp++;
    }
    System.out.print(br);
    }
    static int count(int temp){
        int i,j,k,count=0;
        int temp1=(int)Math.sqrt(temp);
        for(i=0;i<=temp1;i++){
            for(j=0;j<=temp1;j++){
               int x=(temp-i*i-j*j);
               int y=(int)Math.sqrt(x);
               if(y*y==x) count++;
            }
            if(i*i>temp) break;
        }
        return count;
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?