Sicily 1121. Tri Tiling

1121. Tri Tiling

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

In how many ways can you tile a 3xn rectangle with 2x1 dominoes?

Here is a sample tiling of a 3x12 rectangle.

Input

Input consists of several test cases followed by a line containing -1. Each test case is a line containing an integer 0 ≤ n ≤ 30.

Output

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
// Problem#: 1121
// Submission#: 3288659
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <functional>
using namespace std;

int ans[31];

int main() {

    std::ios::sync_with_stdio(false);

    
    ans[0] = 1;
    ans[2] = 3;
    for (int i = 4; i <= 30; i += 2) {
        ans[i] = 3 * ans[i - 2];
        for (int j = i - 4; j >= 0; j -= 2) {
            ans[i] += 2 * ans[j];
        }
    }

    while (1) {
        int temp;
        cin >> temp;
        if (temp == -1) break;
        cout << ans[temp] << endl;
    }

    return 0;
}