PROGRAMMING:Tower of Hanoi II
The classical tower of Hanoi problem often exists as a classical example of recursion. Some people may not know the story of the tower of Hanoi problem. Hanoi tower comes from a story in Indian legend. When God created the world, he made three diamond pillars. On one pillar, 64 pieces of gold discs were stacked in order of size from bottom to top. God ordered Brahman to place the disc on another pillar in order of size from below. Moreover, it is stipulated that the disk can not be enlarged on the small disk, and only one disk can be moved between the three pillars at a time. It is predicted that the universe will be destroyed in a flash when it is finished. Some people believe that Brahman is still moving the disc all the time. Well, of course, this legend is not credible. Now the tower of Hanoi is more like a toy. Gardon received a Hanoi Tower toy as a birthday present.
Gardon is as like as two peas, who are very troublesome. (obviously, they are lazy). It is very difficult to move the 64 discs one by one until all the plates reach the third posts. So Gardon decided to make a slight mistake. He found a similar post and moved the plates to the third posts through this column. The question is: when gardon uses n plates in a game, how many times does he need to move them to the third pillar? Obviously, without the fourth pillar, the solution of the problem is 2 ^ n-1, but now with the help of this pillar, how much is it?
###Input format:
Contains multiple groups of data, each data line, is the number of plates n (1 < = n < = 64).
###Output format:
For each group of data, output a number, the minimum number of moves needed to reach the target.
###Input example:
Here is a set of inputs. For example:
```in
one
three
twelve
```
###Output example:
The corresponding output is given here. For example:
```out
one
five
eighty-one
```
answer：If there is no answer, please comment
Gardon is as like as two peas, who are very troublesome. (obviously, they are lazy). It is very difficult to move the 64 discs one by one until all the plates reach the third posts. So Gardon decided to make a slight mistake. He found a similar post and moved the plates to the third posts through this column. The question is: when gardon uses n plates in a game, how many times does he need to move them to the third pillar? Obviously, without the fourth pillar, the solution of the problem is 2 ^ n-1, but now with the help of this pillar, how much is it?
###Input format:
Contains multiple groups of data, each data line, is the number of plates n (1 < = n < = 64).
###Output format:
For each group of data, output a number, the minimum number of moves needed to reach the target.
###Input example:
Here is a set of inputs. For example:
```in
one
three
twelve
```
###Output example:
The corresponding output is given here. For example:
```out
one
five
eighty-one
```
answer：If there is no answer, please comment