Xorland is a beautiful Kingdom located in the northern part of the Hispaniola Island. You can picture it as a perfect n×n square. Incredibly, n² people live there, each in a perfect 1×1 square. They all have an integer spirit in the range [1, 10⁶]. The King died recently and, as is custom, Xorland must be divided into three parts.

Xorlandic people love to apply the Xor operation on their spirits, so it is normal to expect them to use it also to divide the land. Xorland must be divided by two parallel lines. These parallel lines must also be parallel to one side of the square. Each part will be non-empty. To divide the land, this is what they do:

1. Place two parallel lines inside the square.
2. Construct a non-empty subset of the spirits of the first part and call it A.
3. Construct a non-empty subset of the spirits of the second part and call it B.
4. Construct a non-empty subset of the spirits of the third part and call it C.
5. Apply the Xor operation on A, on B and on C.
6. Find the value of Xor(A) + Xor(B) + Xor(C) and call it SUM.
7. Eat and Drink joyfully for SUM days straight.

Between us, Xorlandic people LOVE eating and drinking! That is why they want to find the partition that yields the greatest sum. Help them! Write a program that finds this number.

Input

The first line of input contains N (3 ≤ N ≤ 5), the length of the sides of the squared area. Then follow N lines, each bearing a spirit. Each spirit will be a positive integer in the range [1, 10⁶].

Output

Output the greatest sum possible.

Sample Cases

Input
3
1 1 1
2 2 2
3 3 3

Output
9

In this case, the optimal choice is to divide vertically. Column 1 is {1, 2, 3}; Column 2 is {1, 2, 3} and Column 3 is {1, 2, 3}. Taking A = {3}, B = {3} and C = {3} we get 3 × Xor{3} = 9, the optimal answer. Note that other subsets may yield 9 as well.