For this Question: Given an integer array A of N integers, find the pair of integers in the array which have minimum XOR value. Report the minimum XOR value.First line denotes N, the size of the array.
Next line denotes N space-separated array elements.

Constraints:
2 <= N <= 100000
0 <= A[i] <= 10^7Print a single integer denoting minimum xor valueSample Input 
4
0 2 5 7

Sample Output
2

Explanation:
0 xor 2 = 2

Sample Input 
4
0 4 7 9

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



class Main {
	public static void main (String[] args) {
		int ans = 0;
        int mini = Integer.MAX_VALUE;
        Scanner sc = new Scanner(System.in);
        int array_size = sc.nextInt();
        int N[] = new int[array_size];
        for (int i = 0; i < array_size; i++) {
            if(mini == 0){
                        break;
                    }

            N[i] = sc.nextInt();
            for (int j = i - 1; j >= 0; j--) {
                ans = N[i] ^ N[j];
                if (mini > ans) {
                    mini = ans;

                }

            }

        }




        System.out.println(mini);

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