Y by
In Mexico, there live
Mexicans, some of whom know each other. They decided to play a game. On the first day, each Mexican wrote a non-negative integer on their forehead. On each following day, they changed their number according to the following rule: On day
, each Mexican writes on their forehead the smallest non-negative integer that did not appear on the forehead of any of their acquaintances on day
. It is known that on some day every Mexican wrote the same number as on the previous day, after which they decided to stop the game. Determine the maximum number of days this game could have lasted.
Proposed by Pavle Martinović



Proposed by Pavle Martinović