You are given an integer array nums and an integer maxC.

A subarray of nums is called stable if the greatest common divisor of all elements in the subarray is strictly greater than $1$. The stability factor of nums is the maximum length of a stable subarray in nums.

You may change at most maxC elements of nums to any positive integers.

Return the minimum possible stability factor of nums after performing at most maxC modifications.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^9$

• $0 \leq$ maxC $\leq n$

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.