You have been given an array of N integers \(A_1,A_2..A_N\). You have to find simple sum for this array. Simple Sum is defined as \(\sum_{i=1}^{i=N}\sum_{j=i}^{j=N}max(A_i, A_{i +1}, \dots, A_{j} ) * (A_i | A_j)\). | denotes the bitwise OR operator.

INPUT:
First line of input consists of integer N. Next line of input consists of N integers \(A_1,A_2..A_N\).

OUTPUT:
Print the simple sum of given array.

CONSTRAINTS:
1 ≤ N ≤ 10⁵
1 ≤ \(A_i\) ≤ 10⁴