You are given a 0-indexed integer array nums. You are allowed to perform the following operation any number of times:

• Select any element in the array and replace it with two positive integers whose sum is equal to the selected element.

For example, if the array is nums = [5, 6, 7], you can choose the element 6 and replace it with 2 and 4, resulting in a new array [5, 2, 4, 7].

Your goal is to make the array sorted in non-decreasing order using the minimum number of operations.

Return the minimum number of operations required to achieve this.

Constraints:

• $1 \leq$ nums.length $\leq 10^3$ ...