Walks, Paths and Connectivity · Medium problem

A triangular prism has two triangles, $1,2,3$ and $4,5,6$, joined by matching edges $14,25,36$ (edges $12,23,31,45,56,64,14,25,36$). What is the maximum number of pairwise internally-disjoint paths from vertex $1$ to vertex $5$ (not adjacent)?