Climbing Stairseasy

def climb_stairs(n: int) -> int:
    # TODO: use dynamic programming (Fibonacci pattern)
    return 0

print(climb_stairs(2))  # 2
print(climb_stairs(3))  # 3
print(climb_stairs(5))  # 8