Leetcode 3326. Minimum Division Operations to Make Array Non Decreasing

You can replace any composite number by its smallest prime factor (primes and 1 are unchanged) in one operation; find the minimum number of such replacements needed to make the array non-decreasing, or return -1 if it's impossible.