AND Square Subsegments

You are given a sequence of non-negative integers $A_1, A_2, \dots, A_N$ and $Q$ queries. A sequence is *good* if the bitwise AND of all its elements is a perfect square. In each query: - you are given two parameters $L$ and $R$ - consider the subsequence $B = A_L, A_{L+1}, \dots, A_R$ - you should find the number of good **contiguous** subsequences of $B$ ### Input - The first line of the input