You are given an array $A$ of $N$ elements. You are required to determine the specialty of the array that is defined as: 

Determine the Bitwise OR of the maximum and minimum elements of every subset of the size that are greater than or equal to $2$ and add them. 

As the answer can be large, you must print it by taking modulo with 1000000007.

Input format

• First line: $N$ denoting the number of elements of the array
• Second line: $N$ space-separated integers denoting the elements of the array

Output format

For each query, you are required to print an integer denoting the specialty of the array.

Constraints

$1 \le N \le 200000$

$1 \le A [ I ] \le 1000$