For this Question: Given an array in which all numbers except two are repeated once. (i. e. we have 2N+2 numbers and N numbers are occurring twice and remaining two have occurred once). Find those two numbers.First line of input contains a single integer N. The next line of input contains 2*N+2 space separated integers.

Constraints:-
1 < = N < = 10000
1 < = Arr[i] < = 100000000Print the two elements separated by space (print the lower element first).Sample Input:-
2
1 3 4 1 5 3

Sample Output:-
4 5

Sample Input:-
3
1 2 3 5 4 3 2 1

Sample Output:-
4 5, I have written this Solution Code: import java.io.*;
import java.util.*;



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



					 BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));

					  int n=Integer.parseInt(bf.readLine());
					  int arr[]=new int[2*n+2];
					  long xor=0;
					  String str[]=bf.readLine().split(" ");

					  for(int i=0;i<2*n+2;i++)
					  {
                           arr[i]=Integer.parseInt(str[i]);
						   xor=xor^arr[i];
					  }

					   int bit=1;



					   while(bit<=xor)
					   {

						   if((bit&xor)!=0)
						   {

							  for(int i=0;i<(2*n+2);i++)
					        {
                             if((arr[i]&bit)!=0)
							 {
								 arr[i]=0;
							 }
					        }
							break;
						   }
						   else
						   {

							   bit=(bit<<1);


						   }
					   }


					   long v=0;
					   for(int i=0;i<(2*n+2);i++)
					   {
                          v=v^arr[i];
					   }

					   long q=v^xor;
					   if(v>q)
					     System.out.print(q+" "+v);
					    else
							System.out.print(v+" "+q);






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