This Demonstration uses NKS rule 232 to solve the majority voting problem (or density classification task) for a binary string by manipulating the input. The majority voting problem consists in determining if there are more 1s or more 0s in . The result is given by convergence of the evolution of the cellular automaton to either all 0s or all 1s.