Problem:
Score : 300 points

Problem Statement

N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.

The i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.

You want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.

At least how many tiles need to be repainted to satisfy the condition?

Constraints

1 \leq |S| \leq 10^5

S_i is 0 or 1.

Input

Input is given from Standard Input in the following format:

S

Output

Print the minimum number of tiles that need to be repainted to satisfy the condition.

Sample Input 1

000

Sample Output 1

1

The condition can be satisfied by repainting the middle tile white.

Sample Input 2

10010010

Sample Output 2

3

Sample Input 3

0

Sample Output 3

0

Solution in Haskell (GHC 7.10.3) (judge verdict: Accepted)

main = do
    xs <- getLine :: IO String
    let ys = reverse xs
    print $ min  (solve 0 (head xs) (tail xs)) (solve 0 (head ys) (tail ys))

solve :: Int -> Char -> String -> Int
solve n c [] =  n
solve n c (x:xs) = if c == x then solve (n+1) ops xs else solve n x xs
    where
        ops = if c == '0' then '1' else '0'