https://school.programmers.co.kr/learn/courses/30/lessons/12945?language=python3
def solution(n):
dp = [0] * (n+1)
dp[0] = 0
dp[1] = 1
dp[2] = 1
for i in range(2, n+1):
dp[i] = dp[i-1] + dp[i-2]
return dp[n] % 1234567
# dp