Each point on the boundary of a square has to be colored in one color. Consider all right triangles with the vertices on the boundary of the square. Determine the least number of colors for which there is a coloring such that no such triangle has all its vertices of the same color.