 of n values, and if we're randomly selecting values from that set with the aim to select a particular value, then the number of temps we need to make to get that desired value is in the best case one. That means that the first value we select from that set is the desired value. We make one attempt. The worst case is n attempts, meaning we try all of those values before we finally get that desired value. Now all of this assumes that we keep track of the values we've already selected and do not select them again. And the average case is n divided by 2 attempts. So if we do this multiple times on average the number of attempts we'll take to get our desired or particular value is n divided by 2.