Question 51
Jure has drawn a regular enneagon (a 9-sided polygon). He wants to arrange the numbers $1$ to $9$ at its vertices so that the sum of the numbers at any three consecutive vertices does not exceed some positive integer $n$. What is the least possible $n$ with which he can succeed?