Walks, Paths and Connectivity · Easy problem

A graph $G$ has vertices $1,\ldots,6$ forming a hexagon (edges $12,23,34,45,56,61$), together with one extra edge $24$. What is the length of the shortest path from vertex $1$ to vertex $4$?