In Professor VKJ's class there are n students and Kuldeep is a TA in the class. So to test the knowledge of Kuldeep he wrote n numbers on the blackboard and asked the question to Kuldeep that if all the students come one by one and decide either to do nothing or choose a number from the blackboard let's say x and then change all numbers on the blackboard with their bitwise xor with x, in other words replace all a_i by a_i^x, where a_i denotes the i^th number written on the blackboard (1 <= i <= n). Read more about bitwise xor here. What will be the maximum sum of numbers at the end on the blackboard that we can get by changing the numbers with the given operations?

Let's suppose if we have {a₁,a₂,a₃…a_n} on the blackboard and one student come he can either decide to do nothing and all the numbers on the blackboard remain the same, or choose a number x from {a₁,a₂,a₃…a_n} and replace all numbers on the blackboard with their bitwise xor with x. Now the new numbers on the blackboard are {a₁^x,a₂^x,a₃^x…..a_n^x}. 

Kuldeep was able to solve this problem, can you solve it?

Input Format 

The first line of input is n the number of students in the class. 1<=n<=3*1e5

The next line contain the n numbers written on the blackboard  {a₁,a₂,a₃......a_n} 0<=a_i<2^30, for all 1 <= i <= n

Output Format

Output should contain single integer which will be the maximum sum of numbers at the end out of all possibilities

PS: Jumping around is considered a bad habit, but sometimes it is good.