Killjee is solving an easy problem. Given an array a containing N positive integers. You need to find the magic value of the array.

Magic value of an array is $\sum_{i=1}^{N}( {b_i}^i )$. where, $b_i$ is number of set bits of $a_i$.

Find and print the answer Modulo $(10^{10}+11)$

INPUT CONSTRAINTS

• $1 \le N \le 10^5$
• $1 \le a_i \le 10^9$

INPUT FORMAT
First line of input contains a single integer N. Next line contains N space separated integers, elements of array a.

OUTPUT FORMAT
Output a single integer, magic value of the array.