Classifying Binary Numbers

Given a positive integer $n$ ($1 \le n \le 1000$), we define a number to be of class $A$ if, in its binary representation, the number of $1$s is greater than the number of $0$s; otherwise, it belongs to class $B$. For example, $(13)_{10} = (1101)_2$ has three $1$s and one $0$, so it is an $A$ class number, whereas $(10)_{10} = (1010)_2$ has two $1$s and two $0$s, making it a $B$ class number. Write a program that counts all numbers from $1$ to $n$ belonging to class $A$ and class $B$, respectively.

inputFormat

The input consists of a single integer $n$ ($1 \le n \le 1000$).

outputFormat

Output two integers separated by a space. The first integer is the number of class $A$ numbers and the second is the number of class $B$ numbers among all numbers from $1$ to $n$.

sample

13

7 6