4. Let $n$ students be such that among any 3 of them, 2 know each other, and among any 4 of them, 2 do not know each other. Find the maximum value of $n$.

 untranslated text remains the same as requested.