**Compilation/Execution Result:**

Given is an array of size N, find all the subsequence which when multiplied results in a number which is Power of 2.

**Input:**

First line contains an integer T denoting number of Test Cases. First line of each test case contains N, the next line contains n integers of the array.

**Output:**

Print the total number of such subsequence exits. As this number can be very large print the result under modulo 10^9+7.

**Constraints:**

1<= T <=100

1<= N <=10^5

1<= A[i] <= 10^9

**Example:**

**Input**

1

3

1 6 2

**Output**

3

**Explanation:**

The subsequence that can be chosen is {1} , {2} and {1,2}.

surbhi_7 | 148 |

Rajat Thakur 2 | 140 |

Ibrahim Nash | 120 |

aksh1996aksh | 117 |

Anupam Prakash 1 | 117 |

Ibrahim Nash | 634 |

ashrepos | 534 |

RealHorror | 395 |

shi143din | 385 |

shaktiman_shaktiman_shaktiman | 363 |

akhayrutdinov | 4052 |

sanjay05 | 3423 |

Quandray | 2446 |

Michael Riegger | 2228 |

Jasleen Kaur 2 | 2012 |