Problem:
Each of the integers is assigned to each vertex of a regular 9-sided polygon (that is, every vertex receives exactly one integer from , and two vertices receive different integers) so that the sum of the integers assigned to any three consecutive vertices does not exceed some positive integer . What is the least possible value of for which this assignment can be done?