Try our new interface for solving problems

Unhappy bus

Unhappy bus

Time limit 1 second
Memory limit 64 MiB

Victor lives quite far from the school, so not to be late for lessons, he takes a bus. Victor - very observant little boy, he tries to ignore all the interesting coincidences that happen in life. One day he noticed that as soon as he sits in a bus, whose number in binary representation of the second digit to the right has edinichku, so it necessarily cause the board to respond to a given lesson. And who likes to go to the blackboard? Moreover, if on the eve sat at the computer and did not learn the lesson! It is obvious that in this case threatens to "deuce" ...

Help Vite a list of buses, which he considers "unlucky" buses.

Input data

In pevroy line recorded the number N (0 ≤ N ≤ 100000) - the number of buses, then contains the numbers of buses m[i] (0 ≤ m[i] ≤ 2^31-1), one per line.

Output data

Derive the number of "unlucky" buses.


Input example #1
Output example #1