Walks, Paths and Connectivity · Medium problem

A graph has vertices $1,\ldots,15$, with $i$ and $j$ joined exactly when $|i-j|=5$. How many connected components does it have?