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

#