def solution(n): fib = [0, 1] prev_1 = 0 prev_2 = 1 if n == 2: return 1 for i in range(2, n): now = prev_1 + prev_2 fib.append(now) prev_1 = prev_2 prev_2 = now # print(fib) return sum(fib[-2:])%1234567