The number of integers Mersenns

Mersenn number is a number that is equal to 2^n-1, where n - integer.

Given an array of integers, count the number of numbers in it Mersenn.

Input

The first line contains the number k - the number of numbers in an array, the following line written the numbers themselves a_1, a_2, …, a_k. (0 < k < 1000, 0 ≤ a_i < 2^31).

Output

Derive a single number - the number of numbers Mersenn in the specified array.

Examples