Determine the number of ways to color the vertices of a regular $n=5$ polygon with $k=4$ colors such that no two adjacent vertices have the same color, where rotations are considered distinct.