For this Question: You were gifted an array Arr of N integers for your last birthday. You want to play with that array but the last element of the array is missing. All you remember is that the xor of all the elements of the array was zero. Print the maximum possible value of the last element.First line of input contains N.
Second line of input contains first N-1 elements of the array Arr that you remember.

Constraints 
2 <= N <= 100000
0 <= Arr[i] <= 1000000000Print the maximum possible value of the last element.Sample input
5
1 5 1 3 

Sample output
6

Explanation : 
(1 ^ 5 ^ 1 ^ 3 ^ 6 ) = 0 and 6 is maximum such possible number, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
    public static void main (String[] args) {
    Scanner sc= new Scanner(System.in);
    int n=sc.nextInt();
    int []x = new int[n-1];
       for(int i=0;i<n-1;i++){
           x[i]=sc.nextInt();
    }

    int a=x[0];
    for(int i=1;i<n-1;i++){
        a ^= x[i];
    }
    System.out.println(a);

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