Question 119
By drawing lines parallel to each of the sides, an equilateral triangle of side length $n$ is divided into $n^2$ equilateral triangles of side length $1$. At most how many segments of length $1$ on the obtained grid can be coloured in red, so that no three red segments form an equilateral triangle?