On the regular pentagon ABCDE, a frog jumps from point A, it can jump to one of the two adjacent vertices at will, and stops jumping once it jumps to point D. How many different jumping methods can the frog jump to point D within 6 times (including 6 times).
在正五边形ABCDE上，一只青蛙从A点开始跳动，它每次可以随意跳到相邻两个顶点中的一个上，一旦跳到D点上就停止跳动．青蛙在6次之内(含6次)跳到D点有多少种不同跳法．
<gadget id="calculator">1 + 1 + 2 + 3 + 5</gadget>
<output>12</output>

<result>12</result>