For this Question: Consider a sequence of integers from 1 to N (1, 2, 3,. .. . N). Your task is to divide this sequence into two sets such that the absolute difference of the sum of these sets is minimum i.e if we divide the sequence in set A and B then |Sum(A) - Sum(B)| should be minimum.The input contains a single integer N.

Constraints:-
1 <= N <= 100000Print the minimum absolute difference possible.Sample Input:-
5

Sample Output:-
1

Explanation:-
Set A:- 1, 2, 5
Set B:- 3. 4

Sample Input:-
8

Sample Output:-
0

Explanation:-
Set A:- 1, 2, 3, 5, 7
Set B;- 4, 6, 8, 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));
           String str=br.readLine().trim();
           long n=Integer.parseInt(str);
           long sum=(n*(n+1)/2)/2;
           int sum1=0,sum2=0;
           for(long i=n;i>=1;i--){
               if(sum-i>=0)
               {
                   sum-=i;
                   sum1+=i;
               }
               else{
                   sum2+=i;
               }
           }
           System.out.println(Math.abs(sum1-sum2));
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?