$2$ Pairing $U_p$

Prove that for every even $n2,$ there exists an instance of the stable matching problem with $n$ jobs and $n$ candidates such that the instance has at least $2^{\frac{n}{2}}$ distinct stable matchings.