// 1260. Nudnik Photographer - http://acm.timus.ru/problem.aspx?space=1&num=1260

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 56;

vector<vector<long long>> dp(MAX_N, vector<long long> (MAX_N, 0));

map<pair<long long, long long>, long long> memo;

long long rec(int n, int last_num, bitset<MAX_N> bset) {
    if (last_num < 1 || last_num > n) return 0;
    bset[last_num] = 0;
    cout << n << " " << last_num << "->" << bset << endl;
    if (n < 1) return 0;
    if (n == 1 && last_num != 1) return 0;
    if (n == 2 && last_num > 3) return 0;

    if (memo.find({n, last_num}) != memo.end()) {
        return memo[{n, last_num}];
    }

    long long ans = 0;
    if (bset[last_num - 2]) ans += rec(n - 1, last_num - 2, bset);
    if (bset[last_num - 1]) ans += rec(n - 1, last_num - 1, bset);
    if (bset[last_num + 2]) ans += rec(n - 1, last_num + 2, bset);
    if (bset[last_num + 1]) ans += rec(n - 1, last_num + 1, bset);

    memo[{n, last_num}] = ans;
    return memo[{n, last_num}];
}


int main() {
    ios::sync_with_stdio(false);

    freopen("input.txt", "r", stdin);

    int N;
    cin >> N;

    memo[{1, 1}] = 1;
    memo[{2, 2}] = 1;
    memo[{2, 3}] = 1;
    for (int num = 2; num <= N; ++num) {
        memo[{num, 1}] = 0;
    }

    bitset<MAX_N> bset(pow(2, N + 1) - 1);
    for (int last_number = 2; last_number <= N; ++last_number) {
        rec(N, last_number, bset);
    }

    long long ans = 0;
    for (int n = 1; n <= N; ++n) {
        for (int last_num = 1; last_num <= N; ++last_num) {
            cout << n << " " << last_num << " " << memo[{n, last_num}] << endl;
            ans += memo[{n, last_num}];
        }
    }

    cout << ans << endl;

    return 0;
}