You are given an integer array nums consisting of positive integers.

You can perform the following operation any number of times:

1. Choose two distinct indices i and j such that nums[i] > $0$ and nums[j] > $0$.

2. Append the value of nums[i] % nums[j] to the end of nums.

3. Remove the elements at indices i and j from nums.

Return an integer representing the minimum possible length of nums after performing the operation any number of times.

Constraints:

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

• $1 \leq$ nums[i] $\leq 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.