백준 [ALGORITHM] - 피보나치수 4 (10826)

def fibo(n):
    if n == 0:
        return 0
    elif n == 1:
        return 0
    else:
        
        lst = [-1] * n
    
        lst[0] = 0
        lst[1] = 1
    
        for i in range(2, n):
            lst[i] = lst[i-1] + lst[i-2]
    
        return lst[-1]
        

n = int(input())
result = fibo(n+1)

print(''.join(str(result)))