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 $14$. What is the length of the shortest cycle in $G$ (its girth)?