"""
Exercise 1: Min Cost Climbing Stairs (LeetCode 746)

cost[i] is paid when you step on stair i; from there you climb 1 or 2. You
may start at stair 0 or 1. Return the min cost to reach the top (just past
the last stair).
"""

def min_cost_climbing_stairs(cost):
    # TODO
    return 0


# --- self-check: do not modify below this line ---
a = min_cost_climbing_stairs([10, 15, 20])
b = min_cost_climbing_stairs([1, 100, 1, 1, 1, 100, 1, 1, 100, 1])
print(a, b)
print("PASS" if (a, b) == (15, 6) else "FAIL")