In the stable matching problem, call a person $($a man or a woman$)$ lucky if they are matched

with someone in the top half of their preference list under some stable matching. Prove that

there must be at least one lucky person.