Level2 피보나치 수

def solution(n):
    answer = 0
    d = [0 for i in range(100001)]
    d[0]=0; d[1]=1
    
    for i in range(2,100001):
        d[i]=d[i-1]+d[i-2]
        if(i==n): answer = d[i]; break
            
    return answer%1234567