WOBURN CHALLENGE 1995
PEG contra PCS

Problem 2: Round Numbers
(ICPSC 1981 #3)

INPUT FILE: test2.in
OUTPUT FILE: test2.out

A positive integer N is said to be a "round number" if the binary representation of N has as many or more zeroes than ones. For example, the integer 9, when written in binary is form, is 1001. 1001 has two zeroes and two ones: thus 9 is a round number. The integer 26 is 11010 in binary; since it has two zeroes and three ones, it is not a round number.

INPUT
An integer K.

OUTPUT
Indicate how many integers less than or equal to K are "round numbers" in the format shown below.

Sample Input File

10

Output for Sample Input

There are 5 round numbers less than or equal to 10.
Downloader failed! Response object 006~ASP 0159~Buffering Off~Buffering must be on.