Eulerian and Hamiltonian Graphs · Easy problem

A graph has a square $A\text{-}B\text{-}C\text{-}D\text{-}A$ (edges $AB,BC,CD,DA$) with one extra pendant vertex $E$ attached only to $A$ (edge $AE$). How many Hamiltonian cycles does this $5$-vertex graph have?