For this Question: Given an array of N elements. In the array, each element is present twice except for 1 element whose frequency in the array is 1. Hence the length of the array will always be odd.
Find the unique number.An integer, N, representing the size of the array. In the next line, N space-separated integers follow.

<b>Constraints:</b>
1 <= N <=10<sup>5</sup>
1 <= A[i] <=10<sup>8</sup>Output the element with frequency 1.Input :
5
1 1 2 2 3

Output:
3, 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 noofterm=Integer.parseInt(br.readLine());

        int arr[] = new int[noofterm];

        String s[] = br.readLine().split(" ");
        for(int i=0; i<noofterm;i++){
            arr[i]= Integer.parseInt(s[i]);

            }





















        System.out.println(unique(arr));

        }
        public static int unique(int[] inputArray)
            {
                int result = 0;
                for(int i=0;i<inputArray.length;i++)
                {
                    result ^= inputArray[i];
                }

                return (result>0 ? result : -1);
            }



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