KöMaL 2013 B4532

In a given $n$×$n$ table, $n$-1 fields are marked. A move consists in interchanging two rows or two columns. Is it always possible to carry out an appropriate sequence of such moves, so that all marked fields terminate under the main diagonal? (The main diagonal of a table connects the top left and bottom right corners.)