For this Question: Given an array A[] of size N. The array contains positive and negative elements both. You need to count number of subsequences that has product of its elements as positive. The single positive element of the array will also contribute in the count.

<b>Note:</b> Since the answer can be huge you need to take count as the modulo of (10^9 + 7).The first line of each test case contains N size of array. Second-line contains elements of array separated by space.

<b>Constraints:</b>
1 <= N <= 10^5
-10^6 <= A[i] <= 10^6For each test case you need to print the count of subsequences which has a product of elements as positive.Sample Input 1
4
-1 -2 0 -1

Sample Output 1
3

Sample Input 2
1
5

Sample Output 2
1

Explanation:
Testcase1: The positive product subsequences are {-1, -2}, {-2, -1}, {-1, -1} so a total of 3., I have written this Solution Code: import math
m=int(math.pow(10,9))+7
def power(n):
	ans=1
	for i in range(0,n):
		ans=(ans*2)%m
	return ans
def cntSubSeq(arr, n): 
    pos_count = 0;  
    neg_count = 0
    for i in range (n):
        if (arr[i] > 0) : 
            pos_count += 1
        if (arr[i] < 0):  
            neg_count += 1
    result = power(pos_count)
    if (neg_count > 0): 
        result = (result *power(neg_count-1))%m
    result -= 1
    return result 
n=int(input())
arr=input().split()
for i in range(0,n):
	arr[i]=int(arr[i])
print (int(cntSubSeq(arr,n))), In this Programming Language: Python, Now tell me if this Code is compilable or not?