MathNet 1990 — Part 01 Question 1

Show that for every integer $n \geq 6$, there exists a convex hexagon which can be dissected into exactly $n$ congruent triangles.