https://school.programmers.co.kr/learn/courses/30/lessons/12945
def solution(n):
dp = [0] * (n + 1)
dp[0] = 0
dp[1] = 1
dp[2] = 1
dp[3] = 2
for i in range(4, n + 1):
dp[i] = dp[i - 1] + dp[i - 2] # 피보나치 수 공식
return dp[n] % 1234567