k = int(input())
M = 216*4
dp = [[0]*(2*M+5) for i in range(1<<16)]
dp[0][0] = 1
mi = 0
for i in range(1<<16):
    for j in range(-M,M+1):
        if dp[i][j] == 0:
            continue
        b = bin(i).count("1")
        for c in range(16):
            if i >> c & 1:
                continue
            x,y = divmod(c,4)
            count = 0
            for dx,dy in ((-1,0),(0,-1),(0,1),(1,0)):
                nx = x+dx
                ny = y+dy
                if nx < 0 or ny < 0 or nx > 3 or ny > 3:
                    continue
                if i >> (nx*4+ny) & 1:
                    count += b+1
                else:
                    count -= b+1
            dp[i|1<<c][count+j] += dp[i][j]
            mi = min(mi,count+j)
print(dp[-1][k])