跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1971. Jzzhu and Numbers

  • ID: 1977
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:挑战
  • 上传者:
  • 位运算
  • 组合数学
  • 动态规划
  • 数学
  • 挑战
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Jzzhu and Numbers

题目描述

D. Jzzhu and Numbers
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Jzzhu have n non-negative integers a1,a2,...,an. We will call a sequence of indexes i1,i2,...,ik (1≤i1<i2<...<ik≤n) a group of size k.

Jzzhu wonders, how many groups exists such that ai1 & ai2 & ... & aik=0 (1≤k≤n)? Help him and print this number modulo 1000000007 (109+7). Operation x & y denotes bitwise AND operation of two numbers.

Input

The first line contains a single integer n (1≤n≤106). The second line contains n integers a1,a2,...,an (0≤ai≤106).

Output

Output a single integer representing the number of required groups modulo 1000000007 (109+7).

Examples
Input
3
2 3 3
Output
0
Input
4
0 1 2 3
Output
10
Input
6
5 2 0 5 2 1
Output
53

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1554 题。保留原作者与原赛事署名。