## Problem Statement:

Dexter and Debra are playing a game. They have *N* containers each having one or more chocolates. Containers are numbered from *1* to *N*, where *i ^{th}* container has

*A[i]*number of chocolates.

The game goes like this. First player will choose a container and take one or more chocolates from it. Then, second player will choose a non-empty container and take one or more chocolates from it. And then they alternate turns. This process will continue, until one of the players is not able to take any chocolates (because no chocolates are left). One who is not able to take any chocolates loses the game. Note that player can choose only non-empty container.

The game between Dexter and Debra has just started, and Dexter has got the first Chance. He wants to know the number of ways to make a first move such that under optimal play, the first player always wins.

**Input Format**

The first line contains an integer *N*, i.e., number of containers.

The second line contains *N* integers, i.e., number of chocolates in each of the containers separated by a single space.

**Output Format**

Print the number of ways to make the first move such that under optimal play, the first player always wins. If the first player cannot win under optimal play, print 0.

**Constraints**

1 ≤ *N* ≤ 10^{6}

1 ≤ *A[i]* ≤ 10^{9}

**Sample Input**

```
2
2 3
```

**Sample Output**

```
1
```

**Explanation**

Only 1 set of moves helps player 1 win.

```
Player: 1 2 1 2 1
Chocolates: 2 3 -> 2 2 -> 1 2 -> 1 1 -> 0 1
```

Output:

321143