We cut a cardboard (perhaps, non-convex) 1000-gon along a straight line. This cut brakes it into several new polygons. What is the greatest possible number of triangles among the new polygons?

Let's think step by step and output the final answer within \boxed{}.
user