Sweet couple integer

Let's call a pair of number in an array **SCI** (means Sweet couple Integer) if the LCM of their number of non prime divisors is largest then all possible pairs in that array. Suppose an array $A$. We can make an array $B$ such that $B_i$ is the number of non prime divisors of $A_i$. So, we can call a pair $(A_i,A_j)$ **SCI**, if $LCM(B_i,B_j)$ is the maximum then any other pair in that array