Proof Writing & Problem Solving · Superchallenge problem

Each of the numbers $1, 2, \ldots, n$ is coloured red or blue. What is the smallest $n$ for which EVERY such colouring contains three numbers of the same colour forming an arithmetic progression $a,\ a + d,\ a + 2d$ with $d \ge 1$?