Walks, Paths and Connectivity · Medium problem

A graph has vertices $1,\ldots,12$, with $i$ and $j$ joined when $i-j$ is a multiple of $4$. How many connected components does it have?