Decreasing Number#1560

Decreasing Number

1 second

128 megabytes

Very easy

You can perform the following operations on a positive integer:

Given a positive integer $n$ , find the minimum number of operations required to obtain $1$ from $n$ .

Input

Each line contains a single positive integer $n$ ( $1 \leq n \leq 1 0^{6}$ 1 \le n \le 10^6).

For each $n$ , print the minimum number of operations required to obtain $1$ on a separate line.

Example 1

Loading

1 \leq n \leq 1 0^{6}