A zero$-$bit array is a non$-$empty integer array where the bitwise AND of all elements is $0.$ For example, $1,2$ is a zero$-$bit array since $1$&$2=0$ but $2,3$ is not since $2$&$3=2.$ Here & denotes the bitwise AND operation.

Given an array arr of $n$ integers, find the number of zero$-$bit subarrays of arr.

Note: A subarray is any contiguous segment of the array.

Example

Suppose $n=3$ and arr $=[4,5,2].$

Here only $5,2$ and $4,5,2$ are zero$-$bit subarrays as $5$&$2=0$ and $4$&$5$&$2=0.$ Hence, we report $2$ as the answer.

Function Description

Complete the function getZeroBitSubarrays in the editor below.