eolymp
bolt
Try our new interface for solving problems
Problems

The number of integers Mersenns

The number of integers Mersenns

Mersenn number is a number that is equal to \textbf{2^n-1}, where \textbf{n} - integer. Given an array of integers, count the number of numbers in it Mersenn. \InputFile The first line contains the number \textbf{k} - the number of numbers in an array, the following line written the numbers themselves \textbf{a_1}, \textbf{a_2}, …, \textbf{a_k}. (\textbf{0} < \textbf{k} < \textbf{1000}, \textbf{0} ≤ \textbf{a_i} < \textbf{2^31}). \OutputFile Derive a single number - the number of numbers Mersenn in the specified array.
Time limit 1 second
Memory limit 64 MiB
Input example #1
5
3 7 10 31 63
Output example #1
4