  Let $\mathcal{C}$ be a permutation class that does not contain all layered
permutations or all colayered permutations. We prove that there is a constant
$c$ such that every permutation in $\mathcal{C}$ of length $n$ contains a
monotone subsequence of length $cn$.
