Reduce to Zero

ECoding

UNSOLVED

Problem Statement

Bob is given a non$-$negative number $N$ and he is expected to bring that number to $0,$ He can perform any of the $2$ operations on $N$ in each move:

$1$: If we take $2$ integers a and $b$ where $N=a^{**}b$ then we can change $N=$max$(a,b)$

$2$: Decrease the value of N by $1.$

Determine the minimum number of moves required to reduce the value of $N$ to $0.$

Example:

Input $-3,$

Output $-3$

Explanation:

$3210$

Input Format

The only line of input format contains a Non$-$negative numbe N

Output Format

For each testrase, Determine the minimum number of mo required to reduce the value of $N$ to $0$

Constraints

$0N{10}^6$