# Coupon Collector's Problem
# Upper Bound: O(n*ln n)

def collector():
    var coupons, draw

    coupons = 0
    draw = 0
    while 0 <= coupons and coupons < 10:
        tick 1
        draw = unif(0,10)
        if draw > coupons:
            coupons = coupons + 1