CZ-SK-MO 2023 Problem 1

Alice and Bob are playing a game on a plane consisting of $72$ cells arranged in circle. At the beginning of the game, Bob places a stone on some of the cells. Then, in every round first Alice picks one empty cell and then Bob must move a stone from one of the two neighboring cells on this cell. If he is unable to do that, game ends. Determine the smallest number of stones he has to place in the beginning so he has a strategy to make the game last for at least $2023$ rounds.