Graph Coloring · Easy problem

The $3$-dimensional cube graph $Q_3$ has $8$ vertices (the binary strings of length $3$) with an edge between any two strings that differ in exactly one bit, so every vertex has degree $3$. $Q_3$ is connected, not complete, and not an odd cycle. What is $\chi(Q_3)$?