Unhappy Bus#247
Victor lives quite far from school, so to avoid being late for lessons, he goes by bus. Victor is a very observant boy and tries to notice all the interesting coincidences that happen in life.
One day he noticed that when he sits on a bus whose number, in binary representation, has a as the second digit from the right, he is always called to the board to answer the lesson. And who likes to go to the board? Especially if, the day before, you spent your time at the computer and didn't prepare the lesson! Obviously, in this case, a deuce is threatened...
Help Victor compile a list of buses which he considers unlucky.
The first line contains the number (0 \leq N \leq 100000) — the number of buses. Then each of the next lines contains a bus number m_i (0 \leq m_i \leq 2^{31} - 1).
Output the count of unlucky buses.
Example 1