Graph Coloring · Easy problem

Six meeting rooms sit around a hexagonal corridor, numbered $1$ through $6$ in order, so room $i$ shares a wall with room $i+1$ (and room $6$ with room $1$). A shortcut corridor also directly connects room $1$ to room $4$. Any two rooms joined by a wall or the shortcut must be painted different colors. What is the fewest colors needed?