N=int(input())
neighbor=[[] for i in range(16)]
for i in range(3):
    for j in range(4):
        neighbor[j*4+i].append(j*4+i+1)
        neighbor[j*4+i+1].append(j*4+i)
        neighbor[i*4+j].append(i*4+j+4)
        neighbor[i*4+j+4].append(i*4+j)
dp=[[0]*1001 for i in range(1<<16)]
dp[0][0]=1
for i in range(1<<16):
    put=i.bit_count()
    for j in range(-500,500):
        if dp[i][j]==0:
            continue
        for k in range(16):
            if (i>>k)&1:
                continue
            nxt=j
            for n in neighbor[k]:
                if (i>>n)&1:
                    nxt+=put
                else:
                    nxt-=put
            dp[i|(1<<k)][nxt]+=dp[i][j]
print(dp[(1<<16)-1][N])