Description

Given a set $A$ = {$1$, $2$, ..., $n$}, let $B$ be a subset of $A$. For any element $x$ in $B$, $2x$ must not be in $B$.
Find the maximum number of elements that can be in set $B$.

Input Format

A single integer $n$ ($1 ≤ n ≤ 10^9$).

Output Format

A single integer representing the maximum number of elements in set $B$.

Sample

100

67