Walks, Paths and Connectivity · Hard problem

A graph has vertices $1,\ldots,30$, with $i\ne j$ joined when $\gcd(i,j)>1$. How many connected components does it have?