25. Binary Number

25. Binary Number

time limit per test: 1 seconds    memory limit per test: 256 megabytes

Little walrus Fangy loves math very much. That's why when he is bored he plays with a number performing some operations.

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

How many actions should Fangy perform to get a number one from number x?

Input

The first line contains a positive integer x in a binary system. It is guaranteed that the first digit of x is different from a zero and the number of its digits does not exceed 106.

Output

Print the required number of actions.

Examples

Input

1

Output

0

Input

1001001

Output

12

Input

101110

Output

8

Note

Let's consider the third sample. Number 101110 is even, which means that we should divide it by 2. After the dividing Fangy gets an odd number 10111 and adds one to it. Number 11000 can be divided by 2 three times in a row and get number 11. All that's left is to increase the number by one (we get 100), and then divide it by 2 two times in a row. As a result, we get 1.

主要是二进制的位数有点多 得用其他方法

二进制去掉一位可以看做 除以二下取整

#include<iostream>
#include<cstdio>
using namespace std;
int main(){
	string s;
	cin>>s;
	int len = s.length()-1,count=0;
	int i;
	for(i = len; i > 0 ;){
		if(s[i] == '1'){
			count++;
			for( i; s[i] != '0' && i>=0; i--)count++;//末尾+1之后从后往前所有的1都变为0 遇到的第一个0变为1   变为0的位数直接当做偶数继续做…… 
			if(i < 0)break;
			else s[i] = '1';
		} else{
			count++;i--;
		}
	}
	cout<<count;
	return 0;
}