## Task 2.

Let $n \geqslant 3$ be a natural number. Determine the minimum number of points that need to be marked inside any convex $n$-gon so that every triangle whose vertices are also vertices of that $n$-gon contains at least one marked point in its interior.