Graph Coloring · Challenge problem

Let $G$ consist of two separate pieces with no edges between them: a $5$-cycle on vertices $1,\ldots,5$ and a $6$-cycle on vertices $6,\ldots,11$. Using $3$ available colors, how many proper colorings does $G$ have in total?