We show that a special case of sorting by reversals can be performed in polynomial time, namely, when the number of breakpoints is twice the distance.