Anonymity, monotonicity, and quota pair systems

We introduce the notion of a quota pair system and show that any social choice procedure, where there are exactly two alternatives and a fixed number of voters, satisfies anonymity and monotonicity if and only if it is uniquely determined by a quota pair system.