A12127 | Changing Array

At a break Vanya came to the class and saw an array of $n$ $k$ -bit integers $a_1, a_2, \ldots, a_n$ on the board. An integer $x$ is called a $k$ -bit integer if $0 \leq x \leq 2^k - 1$ .

Of course, Vanya was not able to resist and started changing the numbers written on the board. To ensure that no one will note anything, Vanya allowed himself to make only one type of changes: choose an index of the array $i$ ( $1 \leq i \leq n$ ) and replace the number $a_i$ with the number $\overline{a_i}$ . We define $\overline{x}$ for a $k$ -bit integer $x$ as the $k$ -bit integer such that all its $k$ bits differ from the corresponding bits of $x$ .

Vanya does not like the number $0$ . Therefore, he likes such segments $[l, r]$ ( $1 \leq l \leq r \leq n$ ) such that $a_l \oplus a_{l+1} \oplus \ldots \oplus a_r \neq 0$ , where $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). Determine the maximum number of segments he likes Vanya can get applying zero or more operations described above.

The first line of the input contains two integers $n$ and $k$ ( $1 \leq n \leq 200\,000$ , $1 \leq k \leq 30$ ).

The next line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $0 \leq a_i \leq 2^k - 1$ ), separated by spaces — the array of $k$ -bit integers.

Print one integer — the maximum possible number of segments with XOR not equal to $0$ that can be obtained by making several (possibly $0$ ) operations described in the statement.