This article considers the variation of the Secretary Problem where at any stage each of the lastmapplicants are available for employment. We show that the form of the stopping rule which maximizes the probability of employing the best applicant is: stop at the first stage, fromr* onwards, when the relatively best applicant is about to become unavailable. A simple algorithm for evaluatingr* and the probability of employing the best applicant is outlined.