The sides and diagonals of convex octagon ABCDEF GH are drawn. How many paths are there starting at A and ending at H from vertex to vertex along the drawn segments so that no vertex is visited more than once? The diagram below shows a valid path in green and an invalid path in red.