Consider a simple graph with 4 vertices arranged in a square, where each vertex is connected to two adjacent vertices, forming a cycle (C4). Each vertex is to be colored using one of three colors: red, green, or blue. No two adjacent vertices can be the same color. How many different ways are there to color the vertices of this graph? Let's think step by step and output the final answer within \boxed{}.
user