Smallest Circular Arrangement with Sum Constraint

Suppose $n$ integers are placed in a circle such that each of the following conditions is satisfied: • at least one of the integers is $0$ • each pair of adjacent integers differs by exactly $1$ • the sum of the integers is exactly $24$ Compute the smallest value of $n$ for which this is possible.