IMO 2013, Day 1-P2
Given $2013$ red and $2014$ blue points in the plane, no three of them on a line. We aim to split the plane by lines (not passing through these points) into regions such that there are no regions containing points of both the colors. What is the least number of lines that always suffice?
One one thing is neutral in the universe, that is $0$.