M3TILE  LATGACH3
English  Vietnamese 
In how many ways can you tile a 3xn rectangle with 2x1 dominoes? Here is a sample tiling of a 3x12 rectangle. Input consists of several test cases followed by a line containing 1. Each test case is a line containing an integer 0 ≤ n ≤ 30. For each test case, output one integer number giving the number of possible tilings.
SAMPLE INPUT
2 8 12 1
SAMPLE OUTPUT
3 153 2131
hide comments
Przemys³aw Pietrzkiewicz:
20090715 15:46:53
When n == 0, there is exactly ONE way of tiling  not using any dominoes at all. 

Micha³ £ukasiewicz:
20090411 23:10:55
If the input number is 0 your program should output 1. I don't get it...

Added by:  ~!(*(@*!@^& 
Date:  20090217 
Time limit:  0.600s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ACM 