Graph Coloring · Easy problem

A map shows $11$ small countries arranged in a ring, each bordering only its two ring neighbors. This map is clearly planar, and the Four Color Theorem guarantees $4$ colors suffice. What is the ACTUAL fewest number of colors needed?