$n$ people met at the party, with $n \ge 2$. Each person dislikes exactly one other person present at the party (but not necessarily reciprocal, i.e. it may happen that $A$ dislikes $B$ even though $B$ does not dislike $A$) and likes all others. Prove that guests can be seated at three tables in such a way that each guest likes all the people at his table.