R = [
    [1, 0, 0, 0],
    [0, 1, 0, 0],
    [0, 0, 1, 0],
    [0, 0, 5, 1]
]

B = [
    [1, 1, 0, 0],
    [0, 1, 0, 0],
    [1, 0, 1, 0],
    [0, 0, 0, 1]
]

P = [
    [1, 0, 0, 0],
    [0, 1, 0, 0],
    [1, 0, 1, 0],
    [0, 10, 0, 1]
]

S = [
    [1, 0, 0, 0],
    [0, 1, 0, 0],
    [0, 0, 1, 0],
    [11, 0, 0, 1]
]

def mul(a, b):
    c = [[0 for i in range(4)] for j in range(4)]
    for i in range(4):
        for j in range(4):
            for k in range(4):
                c[i][k] += a[i][j] * b[j][k]
    return c

def my_pow(a, times):
    res = [[(1 if i == j else 0) for i in range(4)] for j in range(4)]
    while  times:
        if times & 1:
            res = mul(res, a)
        times //= 2
        a = mul(a, a)
    return res

SRP = mul(S, mul(R, P))
SBP = mul(S, mul(B, P))

def simple(st, en, a, b):
    res = mul(st, mul(my_pow(SRP, a), mul(my_pow(SBP, b), en)))
    return res[3][1]

def solve(st, en, rem):
    if rem < 0:
        return 0
    rem //= 2
    lef = 0
    rig = rem
    res = 0
    while rig - lef > 2:
        mid1 = lef + (rig - lef) // 3
        mid2 = rig - (rig - lef) // 3
        if simple(st, en, mid1, rem - mid1) >= simple(st, en, mid2, rem - mid2):
            rig = mid2
        else:
            lef = mid1
    for i in range(lef, rig + 1):
        res = max(res, simple(st, en, i, rem - i))
    return res

def calc(N):
    ans = 0
    ans = max(ans, solve(R, B, N))
    RBP = mul(R, mul(B, P))
    ans = max(ans, solve(RBP, B, N - 1))
    return ans
N = int(input())
print(calc(N))