## M00PAIR - 0 0 Pairs

Đọc đề đẹp hơn ở:
https://codeforces.com/group/FLVn1Sc504/contest/274710/problem/K
https://codeforces.com/group/FLVn1Sc504/contest/274501/problem/X

A sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the computer simultaneously tranforms each digit 0 into the sequence 1 0 and each digit 1 into the sequence 0 1.

So, after the first time step, the sequence 0 1 is obtained; after the second, the sequence 1 0 0 1, after the third, the sequence 0 1 1 0 1 0 0 1 and so on.

How many pairs of consequitive zeroes will appear in the sequence after n steps?

### Input

Clarification for this Problem: The Range of inputs is from 1 to 999 in some order and in particular not in ascending order

### Output

For each input n print the number of consequitive zeroes pairs that will appear in the sequence after n steps.

### Sample

`Sample Input 12 3 45 Sample output 01 135 `

Notice : Long output - 1.45MB - there are a lot of input/output so it is easy to TLE if you dont optimize in/out if you use Java ...

 Added by: ~!(*(@*!@^& Date: 2009-02-27 Time limit: 1s Source limit: 20000B Memory limit: 1536MB Cluster: Cube (Intel G860) Languages: All except: ERL JS-RHINO NODEJS PERL6 VB.NET Resource: Southeastern European 2005