Permutations with Coprimes

Find the minimum number of moves, so that the given sequence of integers becomes a perfect sequence. An integer sequence $S$ of length $n$ is said to be a perfect sequence if $S[i]$ and $S[j]$ are co-prime for any $i,j$ (i and j are not-equal) in $[1,n]$. At each move, one can choose an integer $S[i]$ in the sequence and shall replace it with the number 1. ###Input: - The first line of the i