G = {}

for n in range(10**5):

if n < 10:

G[n] = 2 * n

else:

G[n] = G[n - 2] + 1

print(2 * (G[15548 - 3] + 8))

def G(n):

if n < 10:

return 2 * n

result = 0

while n >= 10:

result += 1

n -= 2

return result + 2 * n

def F(n):

return 2 * (G(n - 3) + 8)

print(F(15548))

from functools import *

@lru_cache(1000)

def g(n):

if n<10:

return 2*n

if n>=10:

return g(n-2)+1

for n in range(10,15500):

g(n)

print(2*(g(15545)+8))

def G(n):

if n < 10:

return 2 * n

k = (n - 9) // 2

m = n - 2 * k

return 2 * m + k

print(2 * (G(15548 - 3) + 8))