[백준][동적 계획법1] 11726. 2×n 타일링(파이썬/Python)

dp = [0,1,2]

for i in range(3, 1001):
    dp.append(dp[i-2] + dp[i-1])

n = int(input())
print(dp[n] % 10007)