Alex takes a set of $N$ points and draws either a red line or a blue line between each pair. What is the smallest $N$ such that he will always create a closed path consisting of four segments, all of the same color?