1821. Hanoi Tower III

单点时限: 2.0 sec

内存限制: 256 MB

A double tower of hanoi contains 2n disks of n different sizes,two of each size.As usual,we’re required to move only one disk at a time,without putting a larger one over a smaller one.

How many moves does it take to transfer a double tower from one peg to another,if disks of equal size are indistinguishable from each other?

输入格式

There are so many tests.Each test have one interger n(1<=n<=60) represented the number of disks.

输出格式

Output a single number of the minimum steps in a line.

样例

Input
1
5
Output
2
62

39 人解决,95 人已尝试。

53 份提交通过,共有 165 份提交。

5.5 EMB 奖励。

创建: 12 年,2 月前.

修改: 2 年,5 月前.

最后提交: 8 月,1 周前.

来源: partychen

题目标签