How do I marry thee? Let me count the ways

A stable marriage problem of size 2n is constructed which contains stable matchings. This construction provides a new lower bound on the maximum number of stable matchings for problems of even size and is comparable to a known lower bound when the size is a power of 2. The method of construction makes use of special properties of the latin marriage problem, which we develop.