Olympiad Number Theory · Superchallenge problem

An ant walks along the edges of a cube from vertex $A$ to the opposite vertex $G$, never revisiting a vertex. How many different paths can it take?