MK-MO 2015 Problem 3

All contestants at one contest are sitting in $n$ columns and are forming a "good" configuration. (We define one configuration as "good" when we don't have 2 friends sitting in the same column). It's impossible for all the students to sit in $n-1$ columns in a "good" configuration. Prove that we can always choose contestants $M_1,M_2,...,M_n$ such that $M_i$ is sitting in the $i-th$ column, for each $i=1,2,...,n$ and $M_i$ is friend of $M_{i+1}$ for each $i=1,2,...,n-1$ .