#P1208F. Bits And Pieces

    ID: 2268 Type: RemoteJudge 2000ms 256MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>bitmasksdfs and similardpgreedy*2600

Bits And Pieces

No submission language available for this problem.

Description

You are given an array aa of nn integers.

You need to find the maximum value of ai(aj&ak)a_{i} | ( a_{j} \& a_{k} ) over all triplets (i,j,k)(i,j,k) such that i<j<ki < j < k.

Here &\& denotes the bitwise AND operation, and | denotes the bitwise OR operation.

The first line of input contains the integer nn (3n1063 \le n \le 10^{6}), the size of the array aa.

Next line contains nn space separated integers a1a_1, a2a_2, ..., ana_n (0ai21060 \le a_{i} \le 2 \cdot 10^{6}), representing the elements of the array aa.

Output a single integer, the maximum value of the expression given in the statement.

Input

The first line of input contains the integer nn (3n1063 \le n \le 10^{6}), the size of the array aa.

Next line contains nn space separated integers a1a_1, a2a_2, ..., ana_n (0ai21060 \le a_{i} \le 2 \cdot 10^{6}), representing the elements of the array aa.

Output

Output a single integer, the maximum value of the expression given in the statement.

Samples

Sample Input 1

3
2 4 6

Sample Output 1

6

Sample Input 2

4
2 8 4 7

Sample Output 2

12

Note

In the first example, the only possible triplet is (1,2,3)(1, 2, 3). Hence, the answer is 2(4&6)=62 | (4 \& 6) = 6.

In the second example, there are 44 possible triplets:

  1. (1,2,3)(1, 2, 3), value of which is 2(8&4)=22|(8\&4) = 2.
  2. (1,2,4)(1, 2, 4), value of which is 2(8&7)=22|(8\&7) = 2.
  3. (1,3,4)(1, 3, 4), value of which is 2(4&7)=62|(4\&7) = 6.
  4. (2,3,4)(2, 3, 4), value of which is 8(4&7)=128|(4\&7) = 12.

The maximum value hence is 1212.