Fastest division

Given an array $arr_1,arr_2,...arr_n$ consisting of $n$ positive integers. You have to make all the elements of this array equal to 1, but you are allowed to perform only one kind of operation. In a single operation, you can choose any integer of the form $p^q$ where $p$ is a [prime number](https://en.wikipedia.org/wiki/Prime_number) and $q\geq 1$ and divide all the divisble numbers of the array b