Walks, Paths and Connectivity · Easy problem

A graph on vertices $1,\ldots,6$ has edges $12,23,34,56$. Including vertex $1$ itself, how many vertices can be reached from vertex $1$ by some walk?