ABCDEFGH is a regular octagon. A and E are opposite vertices of the octagon. A frog starts jumping from vertex to vertex, beginning from A. From any vertex of the octagon except E, it may jump to either of the two adjacent vertices. When it reaches E, the frog stops and stays there. Let a_{n} be the number of distinct paths of exactly n jumps ending in E. Then, what is the value of a_{2n-1}?