[프로그래머스 Level3] 멀리뛰기 Python

def solution(n):
    dp = [0 for _ in range(n + 1)]
    for i in range(1, n + 1):
        if i == 1:
            dp[1] = 1
        elif i == 2:
            dp[2] = 2
        else:
            dp[i] = dp[i - 1] + dp[i - 2]

    return dp[n] % 1234567