There are $2n$ people ($n \ge 2$) sitting around the round table, with each person getting to know both with his neighbors and exactly opposite him sits a person he does not know. Prove that people can rearrange in such a way that everyone knows one of their two neighbors.