1822. Hanoi Tower IV

单点时限: 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.

What if we are required to reproduce the original top-to-bottom order of all the equal-size disks in the final arrangement?

输入格式

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
3
123

34 人解决,75 人已尝试。

46 份提交通过,共有 120 份提交。

5.4 EMB 奖励。

创建: 12 年,2 月前.

修改: 2 年,5 月前.

最后提交: 1 周,2 天前.

来源: partychen

题目标签