Minimum Operations to Equalize Array

Given an array where one operation selects a contiguous subarray and replaces every element with the bitwise AND of that subarray, compute the minimum number of such operations needed to make all array elements equal. The core challenge is to use properties of bitwise AND (monotonicity/idempotence) to determine whether 0, 1, or more operations are required within n ≤ 100 and nums[i] ≤ 1e5.