H-Problem H. xor_2021 CCPC 新疆省赛

时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

Given $n$ positive integers $a_1,a_2,\ldots, a_n$ , request: $\sum_{i=1}^n\sum_{j=1}^n(a_i\oplus a_j)^2$

Among them, " $\oplus$ " means bitwise XOR operation.

The first line contains a positive integer .


The second line contains  positive integers

Output an integer on a line, which is the answer, modulo .

示例1

复制

3
2 5 4

复制