Given an array of $n$ integers, your task is to find the number of different subset xors.
The first line has an integer $n$ : the size of the array.
The next line has $n$ integers $x_1,x_2,\dots,x_n$ : the contents of the array.
Print one integer: the number of different subset xors.
3 3 6 5\n · · \n
4\n
In this case, no other values can be the xor of a subset.