star55 has taken CET (Chinese English Test) for many many times, and finally he decides to take CET by using exhausted searching algorithm. After one week's thinking, he realized that all questions in CET have four options, namely A,B,C,D, and only one of them is correct... What a great discovery! Moreover, he gives out an hypothesis that the correct answer must contain even numbers of As, also Cs, and the number of occurrence of A and C can also be 0, since 0 is also an even number. Under this hypothesis, he wants to know how many possible answers are available for him to try.

For example, if CET has 2 questions in all, the possible correct answer can be: BB, BD, DB, DD, AA, CC.

Input

There are multiple test cases. For each case, there is only one line containing an integer n(1<=n<=10^9), representing the number of questions in CET.

n=0 indicates the end of input, and this line should not be processed.

Output

For each case, output the number of possible correct answers. Since the number can be large, you should only output the last two digits of the number.

Sample Input

```1
2
3
100
0
```

Sample Output

```2
6
20
32
```

author£ºchenyan