题目描述

给定 $n$ 个数 ${a_1,a_2,\cdots,a_n}$，求一个序列 ${b_1,b_2,\cdots,b_n}$ 满足：

1.任意 $b_i\le a_i$ 2.$b_1\ xor\ b_2\ xor\ b_3\ xor\cdots xor\ bn=0$ 3.$sum_{i=1}^{n}b_i>0$

求这样序列的个数。

输入格式

The first line of the standard input contains the number of elements $n$, $1\le n\le 50$.

The second, last line of the standard input contains $n$ positive integers $m_1,\cdots,m_n$, separated by single spaces,$1\le m_i < 2^{32}-1$.

输出格式

Your programme should write one integer to the standard output - total number of different crystals that can be created. You can assume that this number is less than $2^{64}$.

3
2 1 3

5