Walks, Paths and Connectivity · Easy problem

A graph $G$ has vertices $1,2,3,4$ with edges $12,23,34,41,13$ (a $4$-cycle with one diagonal). How many different paths (with no repeated vertex) are there from vertex $1$ to vertex $3$?