Elections in which every Condorcet winning set has four candidates

Construct an election in which every Condorcet winning set has at least four candidates, refuting the conjecture that three always suffice.