def perebor(n, k, B):
    global w
    if k == n:
        if B[ (n + 1) // 2 ] != B[ (n - 3) // 2 ]:
            #print(B)
            w += 1
    else:
        if B[k - 1] != 0:
            B[k] = 0
            perebor(n, k + 1, B)
        if B[k - 1] != 1:
            B[k] = 1
            perebor(n, k + 1, B)
        if B[k - 1] != 2:
            B[k] = 2
            perebor(n, k + 1, B)
        if B[k - 1] != 3:
            B[k] = 3
            perebor(n, k + 1, B)



d = 8

print(4 * 3 ** (2 * d - 3) * 2)

A = [0] * (2 * d - 1)
w = 0

for i in range(4):
    A[0] = i
    perebor(2 * d - 1, 1, A)

print(w)