Graph Coloring · Medium problem

A hub station $0$ is wired directly to all five stations of a ring network $1,2,3,4,5$ (so $1\text{-}2,2\text{-}3,3\text{-}4,4\text{-}5,5\text{-}1$ form the ring, and $0$ connects to each of them). What is the fewest colors needed so that every wired pair gets different colors?