Question 3
Let $n \ge 3$ be a natural number. John draws a regular $n$-gon and connects every pair of vertices. On each segment, John writes a nonzero natural number such that in any triangle formed by three vertices, one of the numbers on its sides equals the sum of the other two.
Determine the smallest number of distinct values John can write.
Determine the smallest number of distinct values John can write.