output_description: Print the value \sum_{i=1}^{N-1}\sum_{j=i+1}^{N} (A_i \mbox{ XOR } A_j),
  modulo (10^9+7).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 ... A_N
attempt: x = int(input())
  a = list(map(int, input().strip().split()))
  s = 1e9 + 7
  list1 = []
  for i in range(0, x - 1):
      for j in range(i + 1, x):
          list1.append(a[i] ^ a[j])
  Sum = 0
  for i in list1:
      Sum += i
  x1 = int(Sum % s)
  print(x1)
  
problem_description: 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.)
samples: [{"input": "3\n    1 2 3", "output": "6\n    \n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\n* * *"}, {"input": "10\n    3 1 4 1 5 9 2 6 5 3", "output": "237\n    \n\n* * *"}, {"input": "10\n    3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820", "output": "103715602\n    \n\nPrint the sum modulo (10^9+7)."}]