number of permutations that are 2-queue sortable is catalan

Statement

The number of permutations in $S_{n}$ (the symmetric group) that are 2-queue-sortable is Catalan, ie. equal to $C_{n}$ .

Proof