Problem 508

2. On the table lie sticks of lengths $1,2,3, \ldots, n$ centimeters. It is known that from them, 50 triangles can be formed, using each stick no more than once, but 51 cannot. Find $n$ (the length of the longest stick)? If there are multiple possible answers, list them in ascending order separated by a semicolon.