{"raw_statement":[{"iden":"problem statement","content":"We have $N$ integers. The $i$\\-th integer is $A_i$.\nFind $\\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\text{ XOR } A_j)$, modulo $(10^9+7)$.\nWhat is $\\text{ XOR }$?The XOR of integers $A$ and $B$, $A \\text{ XOR } B$, is defined as follows:\n\n*   When $A \\text{ 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.\n\nFor example, $3 \\text{ XOR } 5 = 6$. (In base two: $011 \\text{ XOR } 101 = 110$.)"},{"iden":"constraints","content":"*   $2 \\leq N \\leq 3 \\times 10^5$\n*   $0 \\leq A_i < 2^{60}$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$"},{"iden":"sample input 1","content":"3\n1 2 3"},{"iden":"sample output 1","content":"6\n\nWe have $(1\\text{ XOR } 2)+(1\\text{ XOR } 3)+(2\\text{ XOR } 3)=3+2+1=6$."},{"iden":"sample input 2","content":"10\n3 1 4 1 5 9 2 6 5 3"},{"iden":"sample output 2","content":"237"},{"iden":"sample input 3","content":"10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820"},{"iden":"sample output 3","content":"103715602\n\nPrint the sum modulo $(10^9+7)$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}