#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("a.in");

int dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};

pair<int, int> a[20];
long long s = 0;
void f(int n, int k)
{
    if(k == n + 1)
    {
        s++;
        return;
    }
    int ni, nj, ok;
    for(int l = 0 ; l < 4 ; l++)
    {
        ni = a[k - 1].first + dir[l][0];
        nj = a[k - 1].second + dir[l][1];
        a[k] = make_pair(ni, nj);
        ok = 1;
        for(int i = 0 ; i < k ; i++)
        {
            if(a[k] == a[i])
                ok = 0;
        }

        if(ok)
            f(n, k + 1);
    }

}

int main()
{
    int n;
    cin >> n;
    if(n == 1)
    {
        cout << "1\n";
        return 0;
    }
    s = 0;
    f(n - 1, 1);
    cout << s / 2 << "\n";
}