def fib(n): if n == 0: return 0 elif n == 1: return 1 elif n > 1: return fib(n-2) + fib(n-1) n = int(input("")) print(fib(n))
W, L, H = map(int, input("").split()) n = 4 * ((W-2) + (L-2) + (H-2)) print(n)