Square Sort

You are given an array $A$ of $N$ **positive** integers. In one operation, you can do the following: - Choose an index $i$ $(1 \le i \le N)$, and change the value of $A_i$ to either $(A_i)^2$ or $\lfloor \sqrt{A_i} \rfloor$. Find the **minimum** number of operations required, such that, for the final array $A$: - $A$ is sorted in **non-decreasing** order; - $A_N \le 10^{18}$. **NOTE:** The ele