A. Factorial Frenzy
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You've studied how to count the number of 0 digits at the end of $$$n!$$$. But that was for numbers written in decimal. Real computer scientists think in binary! How many 0 digits are at the end of $$$n!$$$ when the result is expressed in binary?

Input

The only line of input contains a single integer $$$n$$$ $$$(1 \leq n \leq 10^6).$$$ (Note that this integer is written in decimal, not binary.)

Output

Print the number of 0 digits at the end of $$$n!$$$, when this integer is written in binary.

Examples
Input
1
Output
0
Input
8
Output
7
Input
1000000
Output
999993
Note

Factorials grow very quickly. Any solution that requires computing $$$n!$$$ as a first step will probably not work here!