skyjiange takes some positive integer x and wants to get number 1 from it. skyjiange repeats the following action: if x is odd, then adds 1 to it, otherwise divides x by 2. skyjiange knows that for any positive integer number the process ends in finite time.

How many actions should skyjiange perform to get number 1 from number x?

each line contains a positive integer x in binary system, its length won't exceed 100000, process to the EOF.

print the required number of actions.

1001001
101110

12
8