What is the number of ways to color the vertices of a regular $n=6$ polygon using $k=3$ colors such that no two adjacent vertices have the same color, considering rotational symmetry?