Problem Statement

The following recurrence relation is given.
$f(0) \ = \ 0$
$f(n) \ = \ f(n/2) \ + \ (n \ mod \ 2)$
$(n$ is an integer$、n/2$ is rounded down to an integer$)$

Among $0 \le n \le 2^{31}-1 \ (2147483647)$,
find the number of $n$ such that $f(n) \ = \ x \ $ and the sum of such $n$.

Input

$x$

An integer $x$ is given on $1$ line.
$0 \le x \le 10^9$

Output

Output the number of $n$ such that $f(n)=x$ and the sum of such $n$, separated by a space.

Sample

5

169911 58851789346035