There is a regular octagon A B C D E F G, a Frog is at the vertex A. it can jump on to any of the vertices except the exactly opposite vertex the frog visits all the vertices exactly once and then reaches vertex E then how many times did it jump before reaching E