import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
#from functools import lru_cache,reduce
#from heapq import heappush,heappop,heapify,heappushpop,heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


class PrepereFactorial2:  # maxnumまでの階乗を事前計算して、順列、組み合わせ、重複組み合わせを計算するクラス。逆元のテーブルもpow無しで前計算する。maxnumに比べて関数呼び出しが多いならこちら
    def __init__(self, maxnum=3*10**5, mod=10**9+7):
        self.factorial = [1]*(maxnum+1)
        modinv_table = [-1] * (maxnum+1)
        modinv_table[1] = 1
        for i in range(2, maxnum+1):
            self.factorial[i] = (self.factorial[i-1]*i) % mod
            modinv_table[i] = (-modinv_table[mod % i] * (mod // i)) % mod
        self.invfactorial = [1]*(maxnum+1)
        for i in range(1, maxnum+1):
            self.invfactorial[i] = self.invfactorial[i-1]*modinv_table[i] % mod
        self.mod = mod

    def permutation(self, n, r):
        return self.factorial[n]*self.invfactorial[n-r] % self.mod

    def combination(self, n, r):
        return self.permutation(n, r)*self.invfactorial[r] % self.mod

    def combination_with_repetition(self, n, r):
        return self.combination(n+r-1, r)


def popcnt3(n):
    return "{:b}".format(n).count("1")


def main():
    mod = 10**9+7
    mod2 = 998244353
    n = int(input())
    B = list(map(int, input().split()))
    pf = PrepereFactorial2(n+1)
    ans = 1
    minuscount = 1
    tmpb = 0
    for BB in B:
        if BB == -1:
            minuscount += 1
        else:
            if tmpb != (tmpb & BB):
                print(0)
                return
            else:
                tmp = 0
                in1 = popcnt3(operator.xor(tmpb, BB))
                any1 = popcnt3(tmpb & BB)
                for i in range(minuscount):
                    tmp += (pf.combination(minuscount, i)*pow(pow(2, minuscount-i, mod), any1, mod) %
                            mod)*pow(pow(2, minuscount-i, mod)-1, in1, mod)*(1 if i % 2 == 1 else -1)
                    tmp %= mod
                ans*=tmp
                ans%=mod
                tmpb=BB
                minuscount=1
    print(ans)


if __name__ == '__main__':
    main()