Y by
Let
be a positive integer. There are two numbers written on a blackboard, one red and one blue. Initially, both are 0. We define the following procedure: at each step, we choose a nonnegative integer
(not necessarily distinct from the previously chosen ones), and, if the red and blue numbers are
and
respectively, we replace them with
and
, which we color blue and red (in this order). We keep doing this procedure until the blue number is at least
.
Determine the minimum value of the red number at the end of this procedure.







Determine the minimum value of the red number at the end of this procedure.