For this Question: Given a set of positive integers. Find the maximum xor of a non-empty subset from the given set.The first line contains an integer N denoting the number of elements in the set.
The next line contains N integers denoting the elements of the set.

1 <= N <= 10^5
1 <= Elements of set <= 10^9Print the maximum subset Xor.Sample Input:
3
2 4 5

Sample Output:
7

Explanation:
Subset {2, 5} has the maximum xor

Sample Input:
3
9 8 5

Sample Output:
13

Explanation:
Subset {8, 5} has the maximum xor, I have written this Solution Code: INT_BITS=32
def maxSubarrayXOR(set,n): 
    index = 0
    for i in range(INT_BITS-1,-1,-1): 
        maxInd = index 
        maxEle = -2147483648
        for j in range(index,n): 
            if ( (set[j] & (1 << i)) != 0 
                     and set[j] > maxEle ): 
                maxEle = set[j] 
                maxInd = j 
        if (maxEle ==-2147483648): 
            continue
        temp=set[index] 
        set[index]=set[maxInd] 
        set[maxInd]=temp 
        maxInd = index 
        for j in range(n): 
            if (j != maxInd and
               (set[j] & (1 << i)) != 0): 
                set[j] = set[j] ^ set[maxInd] 
        index=index + 1
    res = 0
    for i in range(n): 
        res =res ^ set[i] 
    return res 
n=int(input())
arr=input().split()
for i in range(0,n):
	arr[i]=int(arr[i])
print (maxSubarrayXOR(arr,n)), In this Programming Language: Python, Now tell me if this Code is compilable or not?