There is a complete graph $G$ with $4027$ vertices drawn on the whiteboard. Ivan paints all the edges by red or blue colour. Find all ordered pairs $(r, b)$ such that Ivan can paint the edges so that every vertex is connected to exactly $r$ red edges and $b$ blue edges.