Let and be two opposite vertices of a regular octagon. A frog starts jumping from vertex . At each vertex other than , the frog can jump to either of the two adjacent vertices. The frog stops once it reaches vertex . Suppose the frog reaches vertex after jumps. Let denote the number of possible paths for these jumps. Prove that and , where , and , .