Suppose that there are $m$ students in total. We number the students standing in the circle by $1, 2, 3, \ldots, m$, clockwise (starting with an arbitrary student). Denote by $a_{1} < a_{2} < a_{3} < \cdots < a_{n}$ the positions of the $n$ head students obtained in this numbering.

We consider an $n \times m$ table and fill numbers in its cells in the following way: For each $1 \leq i \leq n$, in the $i^{\text{th}}$ row, we start with $a_{i}$ (filling in the first cell of this row with $a_{i}$) and continue with
$$a_{i} + 1,\ a_{i} + 2,\ \ldots,\ m,\ 1, 2, \ldots, a_{i} - 1$$
to the right. We will focus on the hat colors of the students in the first column.

At the second minute, based on the game rule, each student in the first column will wear the hat of the student in the same row but in the second column.

Similarly, at the $k^{\text{th}}$ minute, each student in the first column will wear the hat of the student in the same row but in the $k^{\text{th}}$ column, for each $1 \leq k \leq m$.

Suppose, on the contrary, that we could never find 2 head students (in the first column) wearing hats of the same color. This would imply that at the beginning all the students in each column also wear hats of pairwise different colors, so they belong to distinct classes. Hence, the numbers of students of $n$ classes are the same, which is a contradiction to the hypothesis.

Therefore, at some moment, there are 2 head students wearing hats of the same color.