On a competition called "Mathematical duels" students were given $n$ problems and each student solved exactly 3 of them. For each two students there is at most one problem that is solved from both of them. Prove that, if $s\in \mathbb{N}$ is a number for which $s^2-s+1<2n$, then there are $s$ problems among the $n$, no three of which solved by one student.