피보나치 수

def solution(n):
    
    dp = [0]*100001
    
    dp[1] = 1 
    dp[2] = 1 
    
    for i in range(3,n+1):
        dp[i] = dp[i-1] + dp[i-2]
        
    answer = dp[n] % 1234567
    return answer