Problem:
Score : 400 points

Problem Statement

We have N integers. The i-th integer is A_i.

Find \sum_{i=1}^{N-1}\sum_{j=i+1}^{N} (A_i \mbox{ XOR } A_j), modulo (10^9+7).

What is \mbox{ XOR }?

The XOR of integers A and B, A \mbox{ XOR } B, is defined as follows:

When A \mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.

For example, 3 \mbox{ XOR } 5 = 6. (In base two: 011 \mbox{ XOR } 101 = 110.)

Constraints

2 \leq N \leq 3 \times 10^5

0 \leq A_i < 2^{60}

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the value \sum_{i=1}^{N-1}\sum_{j=i+1}^{N} (A_i \mbox{ XOR } A_j), modulo (10^9+7).

Sample Input 1

3
1 2 3

Sample Output 1

6

We have (1\mbox{ XOR } 2)+(1\mbox{ XOR } 3)+(2\mbox{ XOR } 3)=3+2+1=6.

Sample Input 2

10
3 1 4 1 5 9 2 6 5 3

Sample Output 2

237

Sample Input 3

10
3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820

Sample Output 3

103715602

Print the sum modulo (10^9+7).

Solution in LuaJIT (2.0.4) (judge verdict: Accepted)

local mod = 1000000007
local mfl = math.floor
local function badd(x, y) return (x + y) % mod end
local function bmul(x, y)
  local x0, y0 = x % 31623, y % 31623
  local x1, y1 = mfl(x / 31623), mfl(y / 31623)
  return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod
end
local function lltonumber(str)
  local ret = 0LL
  for i = 1, #str do
    ret = ret * 10LL
    ret = ret + str:sub(i, i):byte() - 48
  end
  return ret
end

local n = io.read("*n", "*l")
local lim = 60
local box = {}
for i = 1, lim do
  box[i] = 0
end
local s = io.read()
local llnum = {}
for z in s:gmatch("%d+") do
  table.insert(llnum, lltonumber(z))
end
local mulcnt = {}
for i = 1, lim do
  mulcnt[i] = 0
end
for i = 1, n do
  local a = llnum[i]
  for j = 1, lim do
    local p = a % 2LL
    if p == 1LL then
      mulcnt[j] = mulcnt[j] + i - 1 - box[j]
      box[j] = box[j] + 1
    else
      mulcnt[j] = mulcnt[j] + box[j]
    end
    a = a / 2LL
  end
end
local ret = 0
local mul = 1
for i = 1, lim do
  ret = badd(ret, bmul(mul, mulcnt[i]))
  mul = (mul * 2) % mod
end
print(ret)