Increasing Xor Sequence

You are given a sequence of n integers a1, ..., an. Count the number of sequences b = b1, ..., bn such that: 0 ≤ b1 ≤ ... ≤ bn 31 and (a1 XOR b1) ≤ … ≤ (an XOR bn). Return this count, modulo 109+7. Here XOR denotes the bitwise XOR. Input The first line of input will contain an integer T, the number of test cases. Each test case will be in two lines. The first line of the case will contain an