You are given an integer n, representing the initial number of oranges you have. Each day, you can choose to perform exactly one of the following actions:

• Eat $1$ orange.

• If n is divisible by $2$, eat n $/ 2$ oranges.

• If n is divisible by $3$, eat $2 imes ($ n $/ 3)$ oranges.

Return the minimum number of days required to eat all n oranges.

Constraints:

• $1 \leq$ n $\leq 2 imes 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.