Robust Matching Colors in a Line

There are $n$ people standing in a line. Each person independently and uniformly picks one of three colors: red, green, or blue. What is the expected number of adjacent pairs $(i, i+1)$ who chose the same color?

Additional robustness twist: before observation, an independent random relabeling of outcome labels is applied. Compute the same target and justify invariance.