We prove a tight lower bound on the number of colors in non-rainbow colorings of plane graphs of girth at least four.