Consider a line of adjacent colorless squares. Color in each individual square black with probability or white with probability , independent of all other squares. A connected component is a maximal sequence of adjacent squares all with the same color. For example, BBWBWWWBBW has 6 connected components. Find the expected number of connected components in our line.